Q.1 Compare two functions n^{2} and 2^{n} 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.