KERALA UNIVERSITY Class 7 design and analysis of algorithms Question Paper 2020

Practice authentic previous year questions for better exam preparation.

Sample Questions

Define Big Oh notation. Express $f(n)=2 n+8$ using Big Oh notation.
Solve $T(n)=2 T(n / 2)+n$ using iteration method.
Define heap. What are the different types of heaps?
Obtain the time complexity of Prim's algorithm for finding the minimum spanning tree.
Derive a recurrence to find the number of ways of parenthesizing a chain of $n$ matrices.