Time: For More Question Papers Visit - www.pediawikiblog.com 70843 Fourth Semester B.E. Degree Examination, June/July 2019 Design and Analysis of Algorithms 3 hrs Max. Marks: 100 Note: Answer any FIVE full questions, choosing ONE full question from each module. jodule-1 Design an algorithm to search an element in a array using sequential search, Discuss the worst case, best case and average case efficiency of this algorithm. (08 Marks) Discuss adjacency matrix and adjacency list representation of a graph with suitable example. (06 Marks) Give the recursive algorithm to solve towers of Hanoi problem. Show that the efficiency of this algorithm is exponential. (06 Marks) OR Give the general plan for analyzing time efficiency of hon recursive algorithms, Derive the worst case analysis for the algorithm to check whether all the elements in a given array are distinct (08 Marks) List and define any three asymptotic notations. What are the various basic asymptotic efficiency classes? (06 Marks) Explain the following types of problems (i) Combinatorial problems (ii) Graph problems. (06 Marks) Modute-2 Write an algorithm to sort “n° numbers using Quick sort. Trace the algorithm to sort the following list in ascending order 80 60 70 640-10 BO 50) (20 (08 Marks) Discuss general divide and conquer technique with control abstraction and recurrence relation (06 Marks) Apply DFS based algorithm and source removal method to find the topological sequence for the graph shown in Fig. Q3(e) (06 Marks) OR Apply Strassen’s matrix multiplication to multiply following matrices. Discuss how this method is better than direct matrix multiplication method. [4 3]_[2 5] 3X (08 Marks) 12 1]"L1 6} Write recursive algorithm to find maximum and minimum element in an array. (06 Marks) Write an algorithm to sort ‘n” number using merge sort (06 Marks) For More Question Papers Visit - www.pediawikiblog.comFor More Question Papers Visit - www.pediawikiblog.com Module-. Write an algorithm to solve knapsack problem using Greedy technique. Find the optimal solution to the knapsack instance n= 7,m= 15 (Pi, Po. Ps) = (10, 5, 15, 7, 6, 18, 3) (Wy, Wa... Wa) = (2,3, 5. 7.1,4.0) (10 Marks) Apply Prim’s algorithm and Kruskal’s method to find the minimum cost spanning tree to the graph shown in Fig, Q5(b). (10 Marks) (10 Marks) Fig.Q6(a) Detine heap. Write bottom-up heap construction algorithm, Construct heap for the list 1,8, 6.5, 3, 7,4 using bottom-up algorithm and successive key insertion method. (10 Marks) Me Define transitive closure ofa directed whose adjacency matrix is given flo 0 1 0} jo 1000 jooort (10 Marks) 10000 jo toot Find the optimal tour for salesperson using dynamic programming technique. The directed graph is shown in Fig.Q7(b) (10 Marks) led aph. Find the transitive closure matrix for the graph Fig. Q1(b) For More Question Papers Visit - www.pediawikiblog.com10 b. b. For More Question Papers Visit - www.pediawikiblog.com OR Write an algorithm to construct optimal binary scarch tree for the follow Ke [ a ee Probability ot | 02 Apply the bottom-up dynamic prog knapsack problem, Knapsack capa (10 Marks) amming algorithm to the following instance of the Item Value 1 2 2 12 3 40 4 (10 Marks) Modute-5 Construct state-space tree for solving four queens problem using backtracking, (06 Marks) Discuss graph coloring problem. Find different solutions for 4 nodes and all possible 3 coloring problem. (06 Marks) Write a note on: (i) Non deterministic algorithms. (i) LC branch and bound solution to solve O/I knapsack problem, (08 Marks) OR What are the two additional items required by Branch and Bound technique, compared with backtracking. Solve the following assignment problem using branch and bound technique, whose cost matrix for assigning four jobs to four persons are given 9 2 798] 6 43 7) 10 Marks) 581 68| « » 76.9 4} Discuss the following (i), Subset sum problem (ii) NP hard and NP complete classes. (10 Marks) For More Question Papers Visit - www.pediawikiblog.com