Describe commonly used asymptotic notations, Data Structure & Algorithms

Q.1 Compare two functions n2 and 2n for various values of n. Determine when second becomes larger than first.

Q.2 Why do we use asymptotic notation in the study of algorithm? Describe commonly used asymptotic notations and give their significance.

Posted Date: 3/29/2013 1:38:32 AM | Location : United States







Related Discussions:- Describe commonly used asymptotic notations, Assignment Help, Ask Question on Describe commonly used asymptotic notations, Get Answer, Expert's Help, Describe commonly used asymptotic notations Discussions

Write discussion on Describe commonly used asymptotic notations
Your posts are moderated
Related Questions
write an algorithm to sort given numbers in ascending order using bubble sort

The Space - Time Trade Off The best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its implementation. But in practic

what is tower of management with example

Pre-order Traversal The method of doing a pre-order traversal iteratively then has the several steps(suppose that a stack is available to hold pointers to the appropriate nodes

#question.explain different types of errors in data transmission.

A  BST is traversed in the following order recursively: Right, root, left e output sequence will be in In Descending order

give some examples of least cost branch and bound method..

State the Introduction to pseudocode No specific programming language is referred to; development of algorithms by using pseudocode uses generic descriptions of branching, loop

Chaining In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element havi

The size of stack was declared as ten. Thus, stack cannot hold more than ten elements. The major operations which can be performed onto a stack are push and pop. However, in a prog