• Note: i) Answer any five questions. eT 5 SsaE & WR Aa Heim or ses &r
• ii) All questions carry equal marks.
Explain the various criteria used for analyzing algorithm.
What is merge sort? Explain merge sort algorithm for the list: 65, 47, 24, 83, 91, 14, 53, 12
Write the algorithm for Stassen's matrix multiplication.
Define Kruskal's algorithm and also write down the steps for the Kruskal's algorithm in detail.
Explain how job sequencing with deadline can be solved using deadlines.
Explain minimum spanning tree using Prim's algorithm for the given graph below. (graph image with vertices 0-8)
Explain Floyd-Warshall algorithm with suitable example.
Explain how job sequencing with deadline can be solved using deadlines.
Find optimal solution for 0/1 Knapsack problem (w1, w2, w3, w4) = (10, 10, 12, 18); (P1, P2, P3, P4) = (2, 4, 6, 0) and M = 15.
Explain in detail 8-Queens problem.
Write about different types of bounding functions with example.
Find the optimal solution using least cost branch and bound with n = 4, m = 15. (w1, w2, w3, w4) = (3, 5, 6, 9); (P1, P2, P3, P4) = (15, 15, 17, 23)
Write about different types of bounding functions with example.
Find the optimal solution using least cost branch and bound with n=4, m=15.
Discuss in detail P, NP, NP complete and NP Hard problems with examples.
Discuss in detail P, NP, NP complete and NP Hard problems with examples.
Find optimal solution for 0/1 Knapsack problem
Binary search trees
Huffman coding
Multistage graph
Hamiltonian cycle
Quick sort.
Write short notes on any three of the following. a) Binary search trees b) Huffman coding c) Multistage graph d) Hamiltonian cycle e) Quick sort.
0/1 Knapsack problem
Explain in detail 8-Queens problem.
