(Pages : 4) L- 2029 Sixth Semester B.C.A. Degree Examination, March 2021 Career Related First Degree Programme Under CBCSS Group 2(b) - Computer Applications Core Course CP 1643 : DESIGN AND ANALYSIS OF ALGORITHMS (2018 Admission Regular) Time : 3 Hours Max. Marks : 80 SECTION - A [Very Short Answer Type] (One word to maximum of two sentences. Answer all questions. Each question carries 1 mark 4. Whatis an algorithm? 2. Whats the time complexity of linear search? 3. Write any two applications of greedy algorithm. 4, What is a spanning tree? 5. _When.do you use dynamic programming? 6. Define principle of optimality 7. Define backtracking. 8. How many possible solutions exist for an 8-queen problem?Whats a live node in branch and bound? 10. What is the worst case time complexity of quick sort? (10 x 1 = 10 Marks) SECTION — B [Short Answer Type] (Not to exceed one paragraph, answer any eight questions. Each question carries 2 marks) e 41. What do you meant by space complexity of an algorithm? 12. Howto calculate the time complexity of a binary search? _ 13. Whatis the advantage of binary search over linear search? 14, ‘What is the importance of asymptotic notations? 18. Explain the. general approach behind divide and conquer technique. 46. Mention the steps for achieving a greedy algorithm? 47. Construct the minimum spanning tree for the given graph using Kruskal’s — 6 18. Write the steps of dynamic programming approach. 49. Whatis single source shortest path? 20. Differentiate explicit constraints and implicit constraints. Discuss the importance of branch and bound technique. L- 202925. What do you understood by average-case complexity of an algorithm? 26. What is the advantage of quick sort? (8 x 2 = 16 Marks) SECTION - C [Short Essay] (Not to exceed 120 words, answer any six questions. Each question carries 4 marks) 27. Discuss the properties of a good algorithm. 28. Differentiate worst case and best case time complexity of algorithm with the help of an example. 29. Implement binary search using divide and conquer strategy. 30. Whats the procedure of Strassen matrix multiplication? 31. Write Prim’s algorithm to find the minimum cost spanning tree. 32. Differentiate between divide and conquer method and dynamic programming method. 33. Computes binomial coefficient, C(n,k) by the dynamic programming algorithm. 34. Explain travelling salesman problem in detail 96. How to solve 8-queens problem using backtracking method? 36. Sort the following list using quick sort. Also explain each phases of its iteration. 49,7, 5, 11, 12, 2, 14, 3, 10, 6} Explain the features of nondeterministic algorithms Define NP-completeness. Give examples. (6 x 4 = 24 Marks) 3 L-2029SECTION - D [Long Essay] (Answer any two questions. Each question carries 15 marks) _ 39. What is recursion? How to convert a recursive algorithm to non-recursive? Explain with an example. 40. Write an algorithm to find the maximum and minimum elements in an array using divide and conquer method. Analyze the algorithm to find the number of ‘comparisons required. 41. How will you implement Knapsack problem using greedy method? Explain with an example. 42, Explain Floyd-Warshall algorithm with an example. 43. Explain least cost branch and bound search with an example. 44, Discuss merge sort algorithm with an example. Also find its complexity. (2 x 15 = 30 Marks)(Pages : 3) N-1769 Name :. Sixth Semester B.C.A. Degree Examination, April 2022 Career Related First Degree Programme Under CBCSS Group 2(b) - Computer Applications Core Course CP 1643 — DESIGN AND ANALYSIS OF ALGORITHMS (2018 & 2019 Admission) Time : 3 Hours Max. Marks °80 SECTION -A Answer all questions. Each carries 1 mark. 1. Define space complexity. What is data structure? What is a tree? Define Omega notation What do you mean by a linear data structure? What is a path? Define graph. SNeaernan What is a spanning tree? What is the purpose of Kruskal's algorithm? a © Ss What are deterministic algorithms? (10 x 1= 10 Marks) PTO.SECTION-B Answer any eight questions. Each carriés 2 marks. 11. Write a short paragraph on algorithm analysis. 12. Whatis selection? 13. Write the best, worst and average time complexity of merge sort. 14, Explain divide and conquer method. 45. What is knapsack problem? 16. Write a note on binary search. 17. Describe big O notation 48. What do you mean by dynamic programming? 19. List any five sorting algorithms. 20. What is backtracking? 21. When do you say an algorithm is good? 22. What do you mean by time complexity of an algorithm? 23. What is Euler graph? 24. Describe shortest path problem. 25. State 8 queen's problem. 26. Define walk in a graph. SECTION - C Answer any six questions. Each carries 4 marks. 27. Write the algorithm for binary search 28. Write a paragraph on Travelling Salesperson’s prob 29. Explain the properties of a good algorithm. 230. Write the three traversal algorithms of binary search tree. 31, Write a note on LC search. 32. Briefly explain non-deterministic algorithms. ; 33. Write down Prim’s algorithm. 34. Compare Euler and Hamiltonian graph. Illustrate with examples. 35. Explain divide-and-conquer method in merge sort. 36. Differentiate NP-hard and NP-complete problem. 37. Write a detailed note on recursive algorithms. 38. Explain the working of Euler tour technique. (6 x 4 = 24 Marks) SECTION -D Answer any two questions. Each carries 15 marks. 39. Write and explain the quick sort algorithm. 40. Discuss the importance of time complexity and space complexity. 41. Explain Strassen’s matrix multiplication. 42. Write down and explain Kruskal's algorithm. 43. Explain in detail about decision problems. 44, What is the application of Knapsack problem? Explain the two t problemA (Pages : 4) L- 2865 Reg. No. : .. Name: .. Fourth Semester B.C.A /B.Sc. Degree Examination, May 2021 Career Related First Degree Programme under CBCSS Group 2(b) - COMPUTER APPLICATIONS/COMPUTER SCIENCE ‘e Core Course CP 1444/CS 1441 - DESIGN AND ANALYSIS OF ALGORITHMS (2015-2017 Admission) Time : 3 Hours Max. Marks : 80 SECTION — A [Very Short Answer Type] One word to maximum of two sentences. Answer all questions: 4. Whatis an Algorithm? @ 2 Whatis sorting? 3. What is a back edge? 4. Whatis state space tree? 5. What do you mean by divide and conquer strategy? 6. Perform step by step Quicksort with 5,8,3,4,2,7. 7. Write a note on Big “O" notation?8. Write a short note on average case. .9. Define an optimal solution. 10. Define indirect recursion. (10x1=10 SECTION -B Not to exceed one paragraph, answer any eight questions. Each carries two 11. Write an algorithm for quick sort. 12, Compare the complexity of Strassens’s Matrix Multiplication and Normal Multiplication. 13. Whats implicit constraints? 14. Whatis the characteristic of greedy method? 15. What are the criteria to be satisfied by an algorithm? 46. Solve the recurrence relation in which a=9, b=3, T(1)=2 and f(n)=4n°. 17. Explain the best case complexity of Quick Sort. 48. Give an algorithm to count the number of leaf node in a binary tree. 49. What are the four distinct area of study of an algorithm? 20. Write the merits of divide and conquer method. 21. Explain implicit and explicit constraints of back tracking? 22. What are the features of dynamic programming?23. 24. 25. 26. 27. 28. 29. 30. 31. 32. Not to exceed 120 words, answer any six questions. Each carries four marks Briefly Explain the Asymptotic notations with Biph. Write an algorithm for recursive binary search and explain the time complexity. Write an algorithm for merge sort. Write an algorithm for N Queens problem. Explain with four Queens problem. ‘Show the procedure to find the element 30 from the list given below using binary search. ,, 31 38 45 50 54 63 70 77 Write an iterative algorithm to find the sum of n numbers. Also find its space complexity? Write an algorithm to swap left and right child of every node in a binary tree. Distinguish between deterministic algorithm and non-deterministic algorithm. Explain traveling salesman problem. (6x4=24 SECTION — D [Long Essay] Answer any two questions. Each questions carries 15 mar 5 Explain all pair shortest path with algorithm and find the all pz matrix for the figure given below.