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
In computer programming, Trees are utilized enormously. These can be utilized for developing database search times (binary search trees, AVL trees, 2-3 trees, red-black trees), Gam

Define tractable and intractable problems Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are

Step 1: Choose a vertex in the graph and make it the source vertex & mark it visited. Step 2: Determine a vertex which is adjacent to the source vertex and begun a new search if

algorithm of output restricted queue.

This notation bounds a function to in constant factors. We say f(n) = Θ(g(n)) if there presents positive constants n 0 , c 1 and c 2 such that to the right of n 0 the value of f

explanation of doubly linklist

The complexity of multiplying two matrices of order m*n and n*p is    mnp

explain the prims''s algorithm with suitable example?

how to draw a 5 inch square on the screen using * symbol