UNIT 2

1. Analyse merge sort algorithm and its ti me complexity.
2. Analyse quick sort algorithm with example.
3. Explain binary search algorithm with example also define it’s pros and cons.
4. Difference between divide and conquer and greedy method.
5. Explain general methodology of divide and conquer and give one example.
6. Write application of divide and conquer.
7. Write characteristics of greedy method.
8. Explain greedy method with example.
9. Write the control abstraction of divide and conquer algorithm.
10. Solve given quick sort algorithm and analyse its time complexity.

      56,34,67,2,39,80,30,10,40,11

     11. Write prims algorithm using greedy method with example.

    12. Explain dijikstra’s algorithm using greedy method and analyse its space complexity.

    13. Explain kruskal method with example.

     14. Solve the knapsack using greedy method

15. Solve job sequencing problem using greedy method.

16. Explain Huffman tree with example.

17. Explain strassen’s matrix multiplication.

18. Explain large integer multiplication with example.