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 Attempt any four 20 marks
- (a) Explain recurrences and various methods to solve recurrences
- (b) Explain in brief the concept of Multistage graphs?
- (c) Explain Asymptotic Notations
- (d) Define P class, NP Class, NP-hard, NP-complete
- (e) What is greedy algorithm?
-
Q2 (a) What is Knuth Morris Pratt Method of Pattern Matching? Give Examples. 10 marks
- (b) Sort the following numbers using Merge Sort also, derive the time complexity of Merge
-
Q3 (a) Explain and differentiate between greedy knapsack and 0/1 knapsack. 10 marks
- (b) Explain Backtracking with n-queen problem. 10
-
Q4 (a) Find the LCS for following strings 10 marks
- (b) Explain quick sort with algorithm and example. 10
-
Q5 (a) Find MST of following graph using prims and Kruskal’s Algorithm. 10 marks
- (b) Write and explain sum of subset algorithm for W = {2,7, 8,9, 15} M=17
-
Q6 Write notes on any two: 20 marks
- (a) Write an algorithm to find the Minimum and Maximum values using divide and conquer strategy and also derive its complexity
- (b) Explain Naive string-matching algorithm with example
- (c) Find the shortest path from source vertex S using Dijkstra’s algorithm
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.