Code: R7321906

R07
DESIGN & ANALYSIS OF ALGORITHMS
(Electronics & Computer Engineering)

B.Tech III Year II Semester (R07) Supplementary Examinations, April/May 2013

Time: 3 hours Answer any FIVE questions All questions carry equal marks **** 1.

Max Marks: 80

(a) Define an algorithm. Explain the various pseudo code conventions with suitable examples. (b) Give brief description about probabilistic analysis. (a) Write algorithms for weighted union and collapsed find. (b) What are connected components? Explain in detail. (a) Explain the Strassen’s matrix multiplication with an example. (b) Write the algorithm for quick sort and explain it with an example. (a) Give the solution for single source shortest path problem. (b) Write short notes on reliability design. (a) Give brief description about the matrix chain multiplication. (b) Explain the procedure to find the shortest path from source to destination for travelling sales person by using dynamic programming. (a) What are implicit and explicit constraints? Explain with an example. (b) Write a recursive back tracking algorithm. (a) Draw the portion of state space tree for n = 5, (P1, P2, P3, P4, P5) = (10, 15, 6, 8, 4), (W 1, W 2, W3, W 4, W 5) = (4, 6, 3, 4, 2) and m = 12. (b) Write control abstraction for LC – search. Discuss in detail about the Cook’s theorem. ******

2.

3.

4.

5.

6.

7.

8.

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.