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
Explain the Assertions in Ruby Ruby offers no support for assertions whatever. Moreover, because it's weakly typed, Ruby doesn't even enforce rudimentary type checking on opera

Consider the following 5-city traveling salesman problem. The distance between each city (in miles) is shown in the following table: (a) Formulate an IP whose solution will

Best Case: If the list is sorted already then A[i] T (n) = c1n + c2 (n -1) + c3(n -1) + c4 (n -1)  = O (n), which indicates that the time complexity is linear. Worst Case:

What is String Carrier set of the String ADT is the set of all finite sequences of characters from some alphabet, including empty sequence (the empty string). Operations on s

Q. Explain the result of inserting the keys given. F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E  in an order to an empty B-tree of degree-3.

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


Merging 4 sorted files having 50, 10, 25 and 15 records will take time

Explain an efficient way of storing a sparse matrix in memory.   A matrix in which number of zero entries are much higher than the number of non zero entries is called sparse mat

Q. Write down an algorithm to delete the specific node from binary search tree. Trace the algorithm to delete a node (10) from the following given tree. Ans. Algor