Computer Engineering Sem 4 Analysis of Algorithm Question Paper PDF 2026 - Mumbai University | munotes
Loading PDF...
Questions asked in this paper
- (3 Figures to the right indicate full marks
-
Q1 (a) Explain asymptotic notations. 5 marks
- (b) Explain Randomized algorithms. 5
- (c) Write an Algorithm for Merge sort and derive its best case and worst case complexity. 10
-
Q2 (a) Explain Master’s Theorem to find the complexity of a recurrence relation 10 marks
- (b) Explain Naive string matching algorithm with example. 10
-
Q3 (a) Explain Single source shortest path algorithm using Dynamic programming with suitable 10 marks
- (b) Write an Algorithm for Graph Coloring problem. Also derive its complexity. 10
-
Q4 (a) Write an Algorithm for knapsack problem using Greedy method. Also derive its complexity 10 marks
- (b) Explain the using Travelling Salesman Problem using Branch and Bound 10
-
Q5 (a) Explain Flow shop scheduling technique. 10 marks
- (b) Write an Algorithm to find minimum cost spanning tree. Also derive its complexity. 10
-
Q6 Write Short notes on (any two) 20 marks
- (b) Job- Sequencing with deadlines
- (c) Multistage Graphs
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Computer Engineering Sem 4 Paper Path
Use this paper as one timed CMPN Sem 4 mock, then compare Operating System, Engineering Mathematics IV, DBMS, Microprocessors, and Analysis of Algorithm papers from nearby year sets.
Step: Open this Computer Engineering Sem 4 paper in the free viewer first.
Step: Compare the May 2024 and December 2022 year sets for repeated subjects.
Step: Use the full CMPN Sem 4 folder when you need more second-year engineering practice.
Quick Help
Related Resources
Something wrong with this paper? Report it.