(a) Define Big O notation and what is its utility in analysis of algo…

Question

(a) Define Big O notation and what is its utility in analysis of algorithms? What is worst case and average case analysis?

(b) Compare and contrast Recursion with Iteration. Giving an example discuss the implementation of recursion.

(c) What is Sparse Matrices? How are they represented in memory?

(d) Write a short note on Garbage Collection.

Related pages

• Asymptotic Notations — topic
• Data Structures syllabus