nm @ DCCA402 11. Find the minimum weight spanning tree using prime algorithm. 12. Construct solution space tree for a set S = {11,13,24,7} &M =31. SECTION-C II Answer any Four questions. Each question carries 8 marks. (4x8=32) 13. Explain in detail the Strassen’s Matrix Multiplication method. Compare its efficiency with the conventional matrix multiplication method. 14. Write the DFS traversal forthe given graph. 15. Trace the quick sort algorithm for the following numbers. 45,36,15,92,35,71,64,39,73,37 16. Solve 4-queue problem by back tracking technique. Draw solution state - space tree. 17. Find the optimal solution fora knapsack problem with M =40. N=4, {W,, Wy, Wy, W,)=(20,25,10,15} {P,, P,, P,, P,}=(20,40,35,45}. 18. Write a short note on : a Hamilton circuit problem. b. Decision tree. (© Scanned with OKEN Scanner| 464884 PAO DCCA402, Reg. No. I IV Semester B.C.A. Degree Examination, September - 2023 COMPUTER SCIENCE Design and Analysis of Algorithms (NEP Scheme) 4 Hours Maximum Marks : 60 Instructions to Candidates: Answer all sections. SECTION-A L Answer any Four questions. Each question carries Two marks. (4%2=8) Seep e IL. Answer any Four questions. Each question carries Five marks. 7 8 10. Define Algorithm. List the methods for specifying the algorithm. Define time complexity and space complexity. List two graph traversal algorithms and write one difference between them. Define binary tree. List three types of binary tree traversal. What is hashing? Define hash table. Define Backtracking and Branch - Bound Technique. SECTION-B Explain worst case, best case and average case efficiencies. Write general plan for analyzing the time efficiency of Recursive Algorithms. Analyze time efficiency for finding a factorial of a number. Write a program [using C or python] to implement binary search algorithm. What is topological sorting? Find the topological sort of a given graph removal method. © f,) ) ©) 6 source [rTO. Scanned wth CamSeanner483383 DCCA402 Reg, No, IV Semester B.C.A, Degree Examination, July/August - 2024 COMPUTER SCIENCE Design and Analysis of Algorithms (NEP Scheme) Time : 2% Hours Maximum Marks : 60 Instructions to Candidates: Answer all the sections. SECTION-A Answer any Four questions. Each question carries 2 marks. (4x2=8) List any two important characteristics of algorithm. Define di ‘and conquer techniques. ‘What is minimum cost spanning tree? Give an example, Define binary tree. List three types of binary tree traversal Define Huffman codes. Whatis backtracking? ae eens SECTION-B Answer any Four questions. Each question carries 5 marks. (4*5=20) 7, Explain worst case, best case and average case efficiencies with examples. 8. Whatis recursive algorithm? Analyse time efficiency for finding factorial of anumber. 9. Write a program to solve Tower of Hanoi problem for different number of disks. 10. What is topological sorting? Find the topological sort of a given graph using source removal method. RTO. (@ Scanned with OKEN ScannerIELTEGE AAT @ att Te Oe DCCaA402 Find the minimum weight spanning tree using prim’s algorithm, 12. Solve sum of subsets using backtracking for S = {3,4,5,6}, M = 13 by constructing solution space tree. SECTION-C Answer any Four questions. Each question carries Eight marks. (4x8=32) 13. Explain fundamentals of Algorithm problem solving with a neat diagram (Sketch). 14, Explain Asymptotic notations used to describe the running time of an algorithm. 15. Trace the quick sort algorithm for the following numbers 45, 36, 15, 92, 35, 71, 64, 39, 73, 37. 16. Solve 4-Queens problem by back tracking techriique. Draw solution state - space tree. 17. Find the optimal solution for a Knapsack problem using Branch and bound method with M=40,N=4. {0,5 7,555 Wa} = (20,25,10,15} {Pus Pa» Py» Pa} = (20,40,35,45} 18. Write a short notes on : a. Travelling sales man problem. b. Decision tree. (ae)