Computer Engineering Sem 4 Analysis of Algorithm Question Paper PDF 2026 - Mumbai University | munotes
Loading PDF...
Questions asked in this paper
-
Q1 Attempt any three out of remaining five questions
-
Q1 Explain the Strassen’s matrix multiplication concept with an example. Derive it’s time complexity [b] Apply the quick sort algorithm to sort the list. in [10] alphabetical order. Analyze the best case, worst case and average case complexities of quick sort [a] Solve following problem of sum of subset.and draw portion of state space [10] Find all possible subsets of w that sum to.m [b] | What is single source shortest path algorithm. Write an algorithm to find [10] 10 marks
-
Q3 [al] Prove that vertex cover problem is NP-complete. [b] Explain various string matching algorithms. [10] 10 marks
-
Q4 [a] Find the minimum cost path to t in the following figure using [b] . Describe the Travelling sales person problem and discuss how to solve it [10] using dynamic programming with example [a] What is longest common subsequence problem? Find the LCS for the [10] Write note.on 8 queen problem, Write an algorithm for the same. [10] Write.a short note on(Any two) 1.Branch and Bound Strategy. [10] 2.Algorithms to find minimum spanning tree. [10] 10 marks
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.