munotes®

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

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

Loading PDF...

Questions asked in this paper

  1. Q1 (a) Solve the following Recurrences using Recursion-Tree Method
    • (b) Explain the Line Segment Properties. 05
    • (c) Suppose that a node x is inserted into a red-black tree with RB-Insert and then 05 immediately deleted with RB-Delete. Is the resulting red-black tree the same as the initial red-black tree? Justify your answer
    • (d) Discuss P, NP, NP-complete and NP-Hard problems. 05
  2. Q2 (a) Evaluate the maximum flow for the following graph. 10 marks
    • (b) What do you mean by Amortized analysis? Explain the Aggregate Analysis 10 method in detail
  3. Q3 (a) Illustrate the operations that can be carried out on binomial heap with example. 10 marks
    • (b) What is the hiring problem? Discuss the randomized algorithm for the same. 10 4.~ (a) What is Red-Black tree? Show Red-Black tree that results from successive 10 insertion of keys 5, 10,15,25,20, 30 and successive deletion of keys 30,
    • (b) Explain the Graham's scan algorithm for finding the convex hull
  4. Q5 (a) What is Randomized algorithm? Differentiate Las Vegas and Monte Carlo 10 marks
    • (b) Explain closest pair of points using divide and conquer. 10
  5. Q6 (a) Explain with example Maximum Biparite matching. 10 marks
    • (b) Prove Travelling Salesman Problem as NP complete. 10

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!