Apr - May 23
Apr - May 23
(Regulations 2021)
Time:Three hours Maximum: 100 marks
(b) What is aHuffman tree? Outline the steps to build a Huffman tree usin.
greedy algorithm design paradigm with an example. (13)
14. (a) State the Hamiltonian circuit problem. Outline the steps to find the
Hamiltonian circuit using backtracking algorithm design paradigm with
an example. (13)
Or
(b) State the Knapsack problem. Outline how Knapsack problem can be
solved using branch and bound algorithm design paradigm with an
example. (13)
15. (a) Elaborate NP-complete problem and NP-hard problem with an example.
(13)
Or
(b) Outine the randomized quick sort algorithm with an example. (13)
16. (a) Apply the insertion sort algorithm to sort the following sequence of
n numbers stored in an array A.
30121
2