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

Practice authentic previous year questions for better exam preparation.

Sample Questions

Define Red-Black trees. Give an example.
Define strongly connected components of a graph. Give an example.
Can the spanning tree of a graph be unique? Explain.
Analyze the running time of Strassen's matrix multiplication algorithm.
Write an algorithm to perform BFS on a graph. $$ \text { ( } 10 \times 4=40 \text { Marks) } $$