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
Q. Draw a B-tree of order 3 for the sequence of keys written below: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10

what is far and near procedures in system programming?

A set s is conveniently shown in a computer store by its characteristic function C(s). This is an array of logical numbers whose ith element has the meaning "i is present in s". As

Explain the Arrays in Ruby Ruby arrays are dynamic arrays which expand automatically whenever a value is stored in a location beyond current end of the array. To the programmer

Multiplication Method: The multiplication method operates in 2 steps. In the 1ststep the key value K is multiplied by a constant A in the range O

N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

Q. Describe what do you understand by the term array? How does an array vary from an ordinary variable? How are the arrays represented in the specific memory?

Q. Implement a stack making use of the linked list. Show the PUSH and POP operations both. A n s . Stack implemantation using linked list # include # include

Q. Describe the adjacency matrix and make the same for the given undirected graph.    Ans: The representation of Adjacency Matrix: This representation consists of

In a sorted list, Binary search is carried out by dividing the list into two parts depends on the comparison of the key. Since the search interval halves each time, the iteration o