Code: 9A05403

B. Tech III Year II Semester (R09) Regular & Supplementary Examinations, April/May 2013 DESIGN & ANALYSIS OF ALGORITHMS (Electronics & Computer Engineering) Time: 3 hours Max. Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 (a) Define an algorithm. Explain the different criteria that satisfy the algorithm. (b) Briefly explain about asymptotic notations. Explain the UNION and FIND operations in detail with data representation. (a) Explain the sorting of elements by using merge sort technique. (b) Present an Iterative algorithm for binary search. (a) Present faster algorithm for job sequencing with deadline and its profits. (b) What is the solution generated by the function JS when n = 7, P [1 : 7 ] = (3,5,20,18,1,6,30) and W [1:7 ] = (1,3,4,3,2,1,2). (a) Write an algorithm of all pair shortest path. (b) Explain the matrix chain multiplication with an example. Generalize Hamiltonian so that it processes a graph whose edge have costs associated with then and finds a Hamiltonian cycle with minimum cost. You can assume that all edge costs are positive. (a) Write an algorithm to solve the knapsack problem with branch and bound algorithm. (b) Explain the solution to the O/1 knapsack problem by using FIFOBB. Write about: (a) Knapsack decision problem. (b) Maximum clique problem. *****

2 3

Code: 9A05403

B. Tech III Year II Semester (R09) Regular & Supplementary Examinations, April/May 2013 DESIGN & ANALYSIS OF ALGORITHMS (Electronics & Computer Engineering) Time: 3 hours Max. Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 (a) Explain the different areas of research where the algorithms can be applied. (b) Explain how to identify the repeated elements. (a) Write a pseudo code for UNION algorithm with weighted rule. (b) Present an algorithm for FIND using collapsing rule. (a) Present an algorithm for merge sort by using linked lists technique. (b) Write the control abstraction for Divide and Conquer. What are the minimum cost spanning trees? Explain the implementation of it by using Prims algorithm. (a) Discuss the dynamic programming solution for the problems of reliability design. (b) Define merging and purging rules in O/1 knapsack problem. (a) Write a back-tracking program for the sum of subsets problem using the state space tree corresponding to the variable tuple size formulations. (b) Prove that the size of the set of all subsets of n elements is 2n. Explain the principles of: (a) Control abstraction for LC-search. (b) Bounding. (c) FIFO branch and bound. (d) LIFO branch and bound. (a) Write short notes on: (i) Classes of NP-hard. (ii) Classes of NP-complete. (b) How are P and NP problems related? *****

Code: 9A05403

B. Tech III Year II Semester (R09) Regular & Supplementary Examinations, April/May 2013 DESIGN & ANALYSIS OF ALGORITHMS (Electronics & Computer Engineering) Time: 3 hours Max. Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) 2 (a) (b) (a) (b) (a) (b) (a) What is meant by recursion? Explain with example, the direct and indirect recursive algorithms. List the advantages of pseudo code convention over flow charts. What is degenerative tree? Write the simple UNION and FIND algorithms. Generate the trees for the set {1, 2, 3, 4,.. n) by using weighted rule. Write Pseudo code for quick sort by using iterative method. Sort the following set of elements by using quick sort. (65, 70, 75, 80, 85, 60, 55, 50, 45). Present a Greedy algorithm for sequencing unit time jobs with deadlines and profits. Present an optimal randomized algorithm for minimum cost spanning trees. How would you construct an optimal binary search tree for a set of n keys if all the keys are equally likely to be searched for? What will be the average number of comparisons in the tree if n=2k? Write a pseudo code of the bottom-up dynamic programming algorithm for the knapsack problem. Explain how the Hamiltonian circuit problem is solved by using the backtracking concept . Device a backtracking algorithm for m-coloring graph problem. What is traveling sales person problem? Solve the following sales person problem instance using branch and bound.

(b)

(a) (b)

0 10 15 20 5 0 9 10 6 13 0 12 8 8 9 0
8 (a) (b) Show that the SET-COVER problem is in NP. Show that the SUBSET-SUM problem is in NP. *****

Code: 9A05403

B. Tech III Year II Semester (R09) Regular & Supplementary Examinations, April/May 2013 DESIGN & ANALYSIS OF ALGORITHMS (Electronics & Computer Engineering) Time: 3 hours Max. Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 (a) Write an algorithm for transpose of a matrix by using step count method. (b) Discuss the different approaches to find the time complexity of algorithm. (a) Write a pseudo code to determine bi components. (b) Define articulation point. Explain it with example. (a) Write an algorithm for quick sort by using recursive method. (b) Derive the time complexity for quick sort. (a) Prove that the greedy method produces an optimal solution to the job sequencing problem. (b) Write an algorithm for Knapsack problem by using greedy technique. (a) What are the differences between greedy and dynamic programming method of problem solving techniques? (b) Explain the concept of dynamic programming through this approach; discuss the solutions for O/1 knapsack problem. (a) Explain how the solutions to the backtracking problems are represented. And how it is built. (b) Give the explicit and implicit constraints in 8-queens problem. (a) Compare FIFO branch and bound and LC branch and bound. (b) Explain the method of reduction to solve TSP problem using branch and bound. (a) Write short notes on: (i) Deterministic and (ii) Non deterministic algorithms. (b) Prove that CNF satisfiability clique decision problem. *****