Unit – 1

1. Define Algorithm.
2. Explain Space Complexity in Detail.
3. Explain Time Complexity in detail.
4. Explain Asymptotic Notations.
5. Define : P class, NP Class and NP Complete class
6. Explain Selection Sort and its complexity.
7. Explain Insertion Sort and Derive its Complexity.
8. Write short note on recurrences
9. Write a short note on recursion Tree.
10.Define master theorem.
11. Solve the following using master method. T(n) = 8T(n/2) + n^2
12.Find the time complexity of given recurrence relation
a. T(n) = 4T(n/2) + n^2
b. T(n) = 2T(n/2) + n^2

Unit – 2

1. Explain the concept of divide and conquer

2. Explain Merge sort and its complexity
3. Derive time complexity of Quick Sort for best case and worst case.
4. Write an algorithm to for finding min –max using divide and conquer. Also
derive complexity.
5. Write the algorithm and derive the complexity of Binary search Algorithm.
6. Explain the strassen’s matrix multiplication concept with an example. Derive its
time complexity.

Unit – 3

1. What is the greedy algorithm approach?

2. What is single source shortest path algorithm. Write algorithm to find
single source shortest path using greedy methods.
3. Solve fractional problem for following. N = 6, p= (18,5,9,10,12,7), w =
(7,2,3,5,3,2).
4. Short note: job sequencing with deadline.
5. Write kruskal’s algorithm and show its working by taking suitable example.
6. Write Prim’s algorithm with suitable example.