1) Describe in detail about the “Average-case efficiency” of algorithm with suitable ex.
2) What do you understand by “Amortized efficiency”?
3) describe in what way we can measure the algorithm’s efficiency?
4) What is known as the basic operation of the algorithm? How to measure the algorithm’s running time?
5) What do you understand by order of growth?
6) describe Big oh notation in detail with appropriate ex.
7) Prove that 100n+5∈O (n^{2})?
8) describe Ω notation in detail with appropriate ex.
9) Prove that n^{3}∈ Ω (n^{2})?
10) describe Θ – notation in detail with appropriate ex.
11) Prove that( ½)n(n-1) ∈ Θ(n^{2})
12) Expalin the use of Asymptotic Notations?