Computer Engineering Sem 4 Analysis of Algorithm Question Paper PDF 2026 - Mumbai University | munotes
Loading PDF...
Questions asked in this paper
-
Q1 (a) Explain recurrences and various methods to solve recurrences. 5 marks
- (b) Differentiate between P and NP. 5
- (c) Differentiate between Prims and Kruskals algorithm. 5
- (d) Explain Dynamic programming with example. 5
-
Q2 (a) Define Branch and Bound and Explain 15 Puzzle problem. 10 marks
- (b) Apply dijkstra’s algorithm on the following graph. 10 Consider vertex 0 as source
-
Q3 (a) Find Longest Common Subsequence for Following strings : 10 marks
- (b) Explain Backtracking with n-queen problem. 10 Formulate Knapsack problem , Explain and differentiate between greedy knapsack 10
- (b) Explain Multistage graph with example. 10
-
Q5 (a) Rewrite KMP algorithm and explain with example. 10 marks
- (b) Define chromatic number of graph. Explain Graph coloring algorithm. 10
-
Q6 Write a short note on following (any 4) : 20 marks
- a) theorem
- c) Steps for NP Completeness proofs
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.