Seat Number

~-021
ITIIIIJ
CS.204
Design and Analysis of Algorithms (New)
(252604)
P. Pages: 1
Time: Three Hours Max. Marks: 60

Instructions to Candidates:
1. Do not write anything on question paper except Seat No.
2. Graph or diagram should be drawn with the black ink pen being used for writing
paper or black HB pencil.
3. Students should note, no supplement will be provided.
4. All questions are compulsory.
5. Figures to the right indicate full marks.

1. Attempt any two. 12

a) Write algorithm for creating max heap using technique INSERT.
b) What is control abstraction? Explain control abstraction for divide and conquer
technique.
c) Write short note on Hamiltonian circuit with example.

2. Attempt any two. 12

a) Explain Strassen's matrix multiplication algorithm.
b) Discuss Finding max & min algorithm.
c) Explain P, NP, NP hard problem.

3. Attempt any two. 12

a) Explain DFS algorithm - with example.
b) Discuss Huffman coding with example.
c) Explain the significance of cook's theorem.

4. Attempt any two. 12

a) Write the algorithm using 8 - Queen problem.
b) Find the solution which gains maximum profit for the following instance of
knapsack problem.
n = 4, m = 50 (P1'P2,P3,P4) = (24,45,20,90)
(W1,W2, W3, W4) = (12,15,20,15)
c) Write an Euclid's algorithm for computing GCD of two integers.

5. Attempt any two. 12

a) Write a short note on greedy technique?
b) Write Kruskal algorithm to find minimum cost spanning tree.
c) Write the rules of removal of recursion.
************