QUES TION BANK Design and Analysis of Algorithms MCA-302 Q1. What do you mean by analysis of algorithm?

Write and analyze the Insertion sort algorithm. Q2. Explain Heapsort and write algorithm for Heapsort and find out the time complexity of that algorithm. Q3. Write a short note on Asymptotic Notation. Q4. Explain divide and conquer approach and discuss it with the M erge sort. Q5. Solve the recurrence relation shown below: i) 6 * 2 n + n 2 = o (3 n) ii) 2n + 3 log (n) = (n) Q6. Write and explain Quicksort algorithm. Q7. Explain : Stacks, Queues and Linked Lists, with their operations. Q8. Explain Binary Search Tree and write Insertion algorithm for BST. Q9. Explain Binary Search Tree and write Insertion algorithm for BST. Q10. Write and explain Insertion of RB Trees. Q11. Write and explain Deletion of RB Trees. Q12. State and prove the properties of Binomial Trees. Q13. Define B-Tree. Discuss the deletion of a key from a B-Tree. Q14. Which is a more efficient way to determine the optimal number of multiplications in a matrix chain multiplication problem enumerating all the ways of parenthesizing the product and computing the number of multiplication for each or running M ATRIX-CHAIN-ORDER? Justify your answer. Find an optimal paranthesization of a matrix-chain product whose sequence of dimensions is (5,10,3,12,5,50,6). Q15. Explain Greedy method and discuss some problems which are solved using this algorithm. Q16. Write and explain Travelling Salesman Problem.

Q17. What is Set cover problem? Discuss its possible solution. Q18. Write and explain RSA cryptography. Q19. What is Vertex cover problem. Q20. Write and explain Longest common subsequence method. Q21. Find the minimum distance of each station from NY. Give the algorithm used and show all the steps. Boston LA 6 2 4 3 4 1 2 1 2 7 NY 5 5 4 3 CK WN

Q22. Use Floydd-Warshall Algorithm to find the shortest paths for all pairs of vertices in the given graph. 2 a 3 c 6 7 b

Q23. What are minimum spanning trees? Write and explain any algorithm to find a minimum spanning tree for a given graph. Q24. What do you understand by M aximum flow, augmenting path? Q25. What is residual graph explain with the help of an example. Q26. Discuss the classes P, NP, NP complete, and NP hard with examples. How can we show that a problem is NP complete. Q27. Write and explain different Approximation algorithms. Q28. Write and explain different Number theoretic algorithms. Q29. Write an algorithm for add Q and delete Q, assuming the queue is represented as a

linked list. Q30. Define Red Black Tree. Prove that a Red Black tree with n internal nodes has height at most 2 log (n+1). Q31. Write and explain Bellman-Ford Algorithm with the help of suitable example. Q32. Write and explain Dijkstras Algorithm with the help of suitable example. Q33. Use the diagraph adjacency matrix below and topologically sort vertices 1 to 5: 1 0 0 0 0 0 2 0 0 0 0 0 3 1 1 0 0 0 4 0 1 0 0 0 5 0 0 1 1 0

1 2 3 4 5

Q34.. Indicate the order in which Kruskals algorithm would include edges in constructing a minimum spanning tree for the following graph: B 5 C E 4 2 F 3 1 G 6 H

Q35. Write and illustrate Counting Sort algorithm. Q36. Explain why Counting sort is called Stable sort. Q37. Illustrate the operation of RADIX-SORT on the following list of English words: COW, DOG, SEA, ROW, M OB, BOX, TAB, BAR, EAR, BIG, TEA, NOW. Q38. Apply BUCKET-SORT algorithm on the following array: 0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.21, 0.12, 0.23, 0.68 Q39. Apply M erge sort on the following array: A= < 9, 16, 52, 5, 8, 25, 35, 50 >

Q40. Solve the following recurrences by substitution method: a) T (n) = 2 T (n / 2) + n b) T (n) = T ( n / 2 ) + T ( n / 2 ) + 1 c) T (n) = 2 T (n) + 1 Q41. Solve the following recurrences by Iteration method: d) T (n) = 3 T (n / 2) + n e) T (n) = 3 T ( n / 4 ) + n f) T (n) = 2 T (n / 2) + n Q42. Solve the following recurrences by recurrence tree method: g) T (n) = 3 T (n / 2) + n h) T (n) = 2 T (n / 2) + n2 i) T (n) = T (n / 3) + T (2 n / 3) + n Q43. Solve the following recurrences by M aster method: j) k) l) m) T T T T (n) = 4 T (n / 2) + n (n) = 4 T (n / 2) + n2 (n) = T (n / 2) + 1 (n) = 4 T (n / 2) + n2 log n

Q44. Apply Kruskals Algorithm to find minimum spanning tree on the following graph:
b

4
a

8
i

7 4 2

9 14
e

11 7
h

2 6
g

10

Q45. Apply Prims Algorithm to find minimum spanning tree on the following graph:
b

4
a

8
i

7 4 2

9 14
e

11 7
h

2 6
g

10

Q46. Write and explain Ford-Fulkerson method.

Q47. What do you understand by amortized analysis? Explain any one algorithm. Q48. What do you understand by Polynomial time reducibility? Q49. What is the relationship between P, NP and NPC classes? Q50. Explain the terms: CLIQUE, INDEPENDENT SET, SAT and 3SAT.