Winter 2012

Master of Computer Application (MCA) Semester 4 MC0080 Analysis and Design of Algorithms 4 Credits
(Book ID: B0891)

(60 Marks)
Answer all Questions 1. Describe the following: o Well known Sorting Algorithms o Divide and Conquer Techniques 2. Explain in your own words the different asymptotic functions and notations. 3. Describe the following: o Fibonacci Heaps o Binomial Heaps 4. Discuss the process of flow of Strassens Algorithm and also its limitations. 5. How do you formulize a greedy technique? Discuss the different steps one by one? 6. Briefly explain the Prims algorithm. Each Question carries TEN Marks