1. What are different asymptotic notations used?

Solve the recurrence relation

T(n)= 3T(n/4)+n
2. Explain merge sort algorithm and sort the given list 70, 80, 40, 50, 60, 12, 35, 95, 10.
3. Explain Quick Sort Algorithm.
4. Explain binary search algorithm and calculate its time complexity.

5. What are different asymptotic notations used? Solve the recurrence relation

T (n) = 6T (n/4) +n

6. Explain merge sort algorithm and sort the given list 27, 10, 40, 50, 60, 12, 55, 10.

7. Explain Strassen’s Matrix Multiplication and calculate its time complexity.

8. Find the shortest path from vertex 1 to vertex 5 in the following weighted graph using
Dijkstra’s greedy algorithm.

9. Explain Huffman Code with an example.

10. Explain Knapsack problem with an example.

11. Explain Huffman Code with an example.
12. Find the optimal binary merge tree (pattern) for ten files whose lengths are 28, 32, 12,
5, 84, 53, 91, 35, 3 and 11. Also find its weighted external path length.
13. Explain Prim’s MST algorithm.
14. Find out MST using prim’s algorithm in following graph.

15 what is principle of optimality? Explain with example.

16. Explain Reliability Design with example.
17. Find optimal solution for 0/1 knapsack problem (w1,w2,w3,w4) = (10,15,6,9);
(P1,P2,P3,P4) = (2,5,8,1) and M = 30.
18. Find a minimum cost path from ‘S’ to ‘t’ in multistage graph using dynamic programming?