BTS (C)— VII-{S)- 06-035 (B) B. Tech Degree VII Semester (Supplementary) Examination June 2006 S703 ANALYSIS AND DESIGN OF ALGC'RITHMS (2002 Admissions) Time : 3 Hours Maximum Marks : 100 1 (@) What do you understand by analyzing algorithms? Giving a1 example, illustrate the steps involved in analyzing algorithm. (19) () Explain divide and conquer technique using an example. (10) OR H.—(@)_—_ Explain the mathematical notations used in the analysis of aljorithins. (10) (b) Explain recurrence tree master theorem. (19) Mt. (a) Illustrate the working of quick sort algorithm. (10) (©) _ Do the time complexity anzilysis of the above algorithm for — @ Average case Gi) Worst case. (10) OR IV. Write an efficient algorithr: to find the K" largest element in an array of N integers. Also analyze the time complexity of the algorithm. (20) v. Explain Prim’s minimum spanning tree ‘algorithm using an examples. Also prove the correctness of the algorithr1 (20) OR VI. (@)_—- Write an algorithm for DFS ina directed graph, For a giver tree draw the depth-first- search forest, (ay © Indicate the data structures used in the above algorithm. Obvain the running time of the algorithm, @) Vil. (@)—_Explain the concept of dyramic programming technique. 5) (6) _ Explain Dijkstra’s algorithm for single source shortest path, «sy oR VIN. (a) What are optimal binary scarch trees? Explain its complexity. (10) (©) Explain Warshall’s algoritsm for transitive closure (10) 1X. | @ Explain traveling salesmar problem. co) (b) _ Define NP-hard problems. Give an example for an NP-hard problem. (a0) OR x. Write notes on a) Approximation algorithms i) Complexity of algorithm Gil) Graph coloring (iv) Hashing, 20)