Question 1 Describe the following-
- Well known Sorting Algorithms
- Divide and Conquer Techniques
Question 2 Describe in your own words the different asymptotic functions and notations
Question 3 Describe the following-
- Fibonacci Heaps
- Binomial Heaps
Question 4 Discuss the process of flow of Strassen's Algorithm and also its limitations
Question 5 How do you formulize a greedy technique? Discuss the different steps one by one?
Question 6 Briefly explain the Prim's algorithm