KERALA UNIVERSITY Class 7 design and algorthims Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

Write an algorithm to delete an element from an AVL Search tree.
Find the optimal solution to the knapsack instance No.of objects $(n)=7$, Capacity of Knapsack $(m)=20$, Profits $(p 1 \ldots p 7)=(10,5,16,4,7,6,19)$ and Weights $(w 1, \ldots, w 7)=(2,7,5,6,4,4,6)$.
When can we say that a problem belongs to NP class? Give an example.
How are bounding functions helpful in obtaining optimal solutions in backtracking method of algorithmic design? Answer any one full questions from each Module.
(a) Write the algorithm for sorting of the numbers $(56,98,10,33,24,67,0,4,100)$ using insertion sort. Find the time complexity. 10