Process of analysis, Data Structure & Algorithms

The objective analysis of an algorithm is to determine its efficiency. Efficiency is based on the resources which are used by the algorithm. For instance,

  • CPU utilization (Time complexity)
  • Memory utilization (Space complexity)
  • Disk usage (I/O)
  • Network usage (bandwidth).

There are two significant attributes to analyze an algorithm. They are given:

Performance: How much /memory/disk/network/ time bandwidth is actually utilized when a program is run. This based on the machine, algorithm, compiler, etc.

Posted Date: 4/4/2013 5:47:30 AM | Location : United States







Related Discussions:- Process of analysis, Assignment Help, Ask Question on Process of analysis, Get Answer, Expert's Help, Process of analysis Discussions

Write discussion on Process of analysis
Your posts are moderated
Related Questions
Part1: Deque and Bag Implementation First, complete the Linked List Implementation of the Deque (as in Worksheet 19) and Bag ADTs (Worksheet 22). Files Needed: linkedList.c Linke

Determine about the logic gates Many electronic circuits operate using binary logic gates. Logic gates essentially process signals that represent true or false or equivalent i.

The structures of files vary from operating system to operating system. In this unit, we will discuss the fundamentals of file structures with the generic file organisations. A

In internal sorting, all of the data to be sorted is obtainable in the high speed main memory of the computer. We will learn the methods of internal sorting which are following:

What values are automatically assigned to those array elements which are not explicitly initialized? Garbage values are automatically assigned to those array elements that

Maximum numbers of nodes a binary tree of depth d The maximum numbers of nodes a binary tree of depth d can have is 2 d+1 -1.

explain quick sort algorithm

Data type An implementation of an abstract data type on a computer. Therefore, for instance, Boolean ADT is implemented as the Boolean type in Java, and bool type in C++;

Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its subinstances.