Generate KERALA UNIVERSITY Class 7 design and analysis of algorithms Question Paper
Create exam-ready question papers instantly using ZenQB AI. Perfect for teachers and students.
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) } $$