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
- (a) Explain Best Case, Average Case and Worst Case. 5
- (b) Explain Multistage graphs. 5
- (c) Explain Binary search algorithm. 5
- (e) What is greedy algorithm? 5
- (a) Write and explain sum of subset algorithm for n=5, W= {2,7,8,9,15}, M=17
- (b) Obtain the solution to the following knapsack problem using Greedy method: n=7, m=15
- (a) What is the Longest Common Subsequence problem? Find the LCS for following strings
- (b) Explain quick sort with algorithm and example. 10
- (a)What is Knuth Morris Pratt Method of Pattern Matching? Give Examples
- (b) Solve the following Recurrence using Substitution Method. 10
- (a) Find the Dijkstra’s shortest path from vertex to vertex 4 for the following graph
- (b) Apply Merge sort algorithm to sort the following numbers. Show each step clearly. 10, 5,
-
Q6 Write notes on (any two): 20 marks
- (a) Find Minimum and Maximum elements of an array X[0 : 9] = (45, 83, 75, 17, 43, 37, 80, 53,61, 22) using divide and conquer strategy
- (b) Naive string matching algorithm with example
- (c) N-queen problem algorithm with example
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.