munotes®

Engineering B.E. (Computer Engineering) Sem 5 Advanced Algorithms Dec 2019 Question Paper - Mumbai University | munotes

Advanced Algorithms Question Paper, Dec 2019.pdf
CMPN · 36 KB · 1 May 2025

Loading PDF...

Older exam May 2019 Semester-end · Advanced Algorithms →
Newer exam None yet: this is the latest New papers land after each exam season.

Questions asked in this paper

  1. Q1 (a) Differentiate between P, NP, NP Complete and NP-Hard classes of Complexity. 5 marks
    • (b) Define Red-Black tree. 05
    • (c) Write short note on bipartite matching. 05
    • (d) Explain recurrences with example. 05
  2. Q2 (a) Define Maximum flow and Minimum-Cut. Apply Ford Fulkerson algorithm on following. 10 marks
    • (b) What is convex hull? Explain Jarvis March in detail. 10
  3. Q3 (a) Prove that Vertex Cover is NP-Complete. 10 marks
    • (b) Explain Master theorem, and apply on the following examples. 10
    • ii)T(n)= 4T(n/2)+ n?
  4. Q4 (a) Explain steps to prove any problem as NP Complete problem. 10 marks
    • (b) Define Binomial Heap, Explain its operations with example. 10
    • (a) Explain DELETE operation in Red-Black Tree. Discuss its time complexity. 10
    • (b) Prove that TSP is NP-Complete. 10
  5. Q6 Write a short note on following (any 4) 20 marks
    • (a) Amortized Analysis
    • (b) Randomized Algorithm
    • (c) Relabel to Front algorithm
    • (e) NP-Completeness

Read from the scan above, so a character or two may differ. The scan is the original.

Issue

Something wrong on this page? Report it and we will check it against the scan.

Quick Help

No. The full paper opens straight away, with no login and nothing to pay.

Something wrong with this paper? Report it.

Connected Papers
Engineering / B.E. (Computer Engineering) · 250 papers
Browse all →
Questions? Email contact@munotes.in
Done!
Done!