DECCAN COLLEGE OF ENGINEERING AND TECHNOLOGY B.E. VI SEMESTER CSE A& B 2022 DESIGN AND ANALYSIS OF ALGORITHMS: (UNIT-1 & UNIT-2) ASSIGNMENT -1 Short_answer questions: (23/04/2022) 1) Define an algorithm, What are the characteristics of an algorithm? 2) Briefly explain a recursive algorithm with example. 3) What are "Asymptotic Notations"? 4) Solve the following recurrence relations: a)T(n)=T() n=l Tinh) + fn) n> where a=2 , b=2 , T(1)=2,f(n)=n. n=0 T (m1) +2 >0 5) What is the "weighting union rule" and "collapsing find rule"? 6) Give the algorithm for Matrix multiplication and find the time complexity of the algorithm using - step count method. 7) Write the recurrence relation of merge sort algorithm and derive the complexity in the worst case. 8) Write an algorithm for quick sort and write the best case and worst case time complexities. 9) Write the control abstraction for "Divide and Conquer”. List the differences between divide and conquer and greedy method. 10) What do you mean by the Brute force strategy? Define the convex hull problem. b) Tin) Long answer questic 11) Briefly explain Performance measurement of an algorithm, 12)Define a spanning tree, Compute a minimum cost spanning trees using both prims and kruskals for the graphs below: Scanned with CamScanner13)Solve the fractional knapsack problem the profits are (p1,p2,p3,p4,p5) = (20,30,66,40,50) and (w1,w2,w3,w4,w5) = (10,20,30,40,50), ‘The knapsack capacity is 100, 14) What is the gle Source Shortest Path" problem. Use the algorithm to obtain in non-decreasing order the lengths of shortest path from vertex 1 to all the remaining vertices: 15) Briefly explain the Brute force string matching with an example. Write down its algorithm. 16) Define what is Exhaustive search? Explain travelling salesperson problem. Scanned with CamScanner