B.Sc. (Computer Science) Sem 2 Design and Analysis of Algorithms Mar 2026 Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q1 Attempt any two 10 marks
   • A) Explain the concept of recursion in programming with a brief note.
   • B) Define stack in data structures and explain its basic operations.
   • C) Describe the binary search technique and explain how it works.
   • D) Discuss the different stages involved in the analysis of an algorithm.
2. Q11 Attempt any two 10 marks
   • A) Write a short explanatory note on merge sort.
   • B) Compare selection sort and insertion sort with suitable points of difference.
   • C) Explain the various types of complexity used in data structures.
   • D) Briefly describe the concept of backtracking in programming.
3. Q11 I Attempt any two 10 marks
   • A) What is linear search? Explain its working briefly.
   • B) Write a short note on the bubble sort technique.
   • C) Explain dynamic programming and discuss its importance in problem solving.
   • D) State and explain the advantages and disadvantages of the divide and conquer technique.

Read from the scan above, so a character or two may differ. The scan is the original.