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

Questions asked in this paper

1. Q1 Attempt any two 10 marks
   • A) Define Big-O notation and explain how to calculate it for an algorithm.
   • B) Explain with the help of a suitable example infix-to-postfix conversion.
   • C) What are the different types of complexities in algorithm analysis?
   • D) What is the difference between a greedy algorithm and dynamic programming? Provide an examples where each is applicable.
2. Q11 Attempt any two 10 marks
   • A) Explain the brute force method for string pattern matching.
   • B) What is the difference between a depth-first search (DFS) and a breadth-first search (BFS)? Discuss their applications.
   • C) What is backtracking, and how is it used in problem-solving?
   • D) What is a circular linked list, and how does it differ from a regular singly linked list?
3. Q11 I Attempt any two 10 marks
   • A) What is stack ? Present a suitable example and explain it with the help of different operations used in it.
   • B) Describe the fundamental attributes that every algorithm should possess. Why are these important?
   • C) Explain the concept of a queue. What are the various operations performed on a queue, and how do they work?
   • D) What are the different types of sorting . Explain in brief with suitable example.

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