—- Registration No : CLE] | - CELE Total Number of Pages : 02 B.Tech RCS4CoozRIT4cooz 4" Semester Regular/Back Examination: 2021-22 Design and Analysis of Algorithms BRANCH(S): CSE, CSEAIME, cST, ELECTRICAL & C.E, IT Time : 3 Hour Max Marks : 100 Q.Code : J775 Answer Question No.1 (Part-1) which is compulsory, any eight from Partll and any two from Part-lll. The figures in the right hand margin indicate marks. Part-I (2x 10) at Answer the following questions :, a) ‘Is. greedy algorithm suitable to find the optimal solution? b) Write the advantages and disadvantages of Breadth First Search over Depth First Search. ) What is the physical significance of asymptotic notations? d) Explain the strategy of dynamic programming. @), Write the recursion of merge.sort and solve it by Master's method. oo Given three matrices A(10x50), B(60x100) and C(100x5). What is the minimum number of scalar multiplications required to multiply these three matrices. g) Whats the difference between LIFOBB and LCBB? h) Differentiate between decision problem and optimization problem i} Differentiate between deterministic and non deterministic algorithm. j) Whatis heuristics? How it solves the problem? $ ee 289) Partll 23 Qa Only Focused-Short Answer Type Questions- (Answer Any Eight out of (68) Twelve) What do you mean by time complexity of an algorithm? Explain the best, worst and average case time complexity. . : b} Solve the following recurrence using Iteration method. T(n) = 4 for n=1 =5T(n/2) + on? for other values of n Sort the following array of elements using randomized quick sort 12, 67, 34,378, 23, 45, 69, 17, 28, 10, 27,59 Write the Kruskal’s algorithm to construct the minimum spanning tree and find the 4) time complexity. . Explain the strategy of greedy technique to find the optimal solution of fractional e) ) knapsack problem? . f)_ Construct the state space tree for solving 4-queen problem and explain how backtracking can be used to solve the problem with reduced time complexity. Can we say‘greedy algorithm:as an approximation algorithm?austify your answer. gy h) Define matrix chain multipication problem. Explain how dynamic programming a) osQ3 a5 a) b b) a) 5 a) ») : i Sf it technique finds the optimal solution 0! Explain topological sorting with 2 suit example What is reducibilty? Exolain with exer Is Dijkstra's algorithm suitable for graphs “"" negative weight edges? Justify your answer. Explain the following problems. Vertex cover decision problem and Vertex Cover optimization problem, Clique Decision problem and Max Clique problem, Chromatic number Decision problem and Chromatic number ‘optimization problem Part-lil ‘Only Long Answer Type Questions (AnsWer Any Two out of Four) What is recursion? Explain the recursion tree method to solve the recursion. Explain how greedy algorithm works to find the optimal solution of activity selection problem. hitps:/www.bputonline.com ° Construct the decode tree for the given letters and their frequéhncies of occurrence in the message. (a,b,c, d.e,f.g)=(1, 1,2, 3,5. 8, 13) ind the longest common subsequence in the following given two sequences X="ROADS" Y="CROSS" Explain how the LIFO Branch and Bound technique works to solve the 8-puzzle problem. Explain by constructing the state space tree. . Assuming 3:SAT problem ‘as an NP-complete problem, ‘feduce Node cover decision problem to 3-SAT problem What is approximation algorithm? Explain a 2-approximation algorithm to solve Travelling Salesman Problem. Explain P, NP, NP-hard and NP-complete class of problems. (8) (8) (8) (8) (8) (8) 8) (8)