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

The quick sort algorithm exploit design technique Divide and Conquer

What is Assertions Introduction At every point in a program, there are generally constraints on the computational state that should hold for program to be correct. For ins

Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up

Binary Search Tree let three types of traversals by its nodes. They are: Pre Order Traversal In Order Traversal Post Order Traversal In Pre Order Traversal, we ca

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:

Explain divide and conquer algorithms  Divide  and  conquer  is  probably  the  best  known  general  algorithm  design  method.  It   work according to the following general p

pseudo code for fibonnaci series

Channel access In first generation systems, every cell supports a number of channels. At any given time a channel is allocated to only one user. Second generation systems also

Given are the definitions of some important terms: 1) Field: This is an elementary data item characterized by its size, length and type. For instance, Name