Syllabus for T-3

1. Analysis of Recurrence relations

a. Masters Methods
b. Substitution Method
c. Recursion tree Method
Note: Practice more and more questions based on solving recurrence
relations
2. Divide and conquer Algorithms
- try to learn the approach of solving the problems using D & C
3. Priority Queue
a. Binary heap
b. Fibonacci heap
4. Greedy Algorithm
a. Dijkstras Algorithm
5. Dynamic Programming (all topics covered in class)
6. String Matching (Nave String matching, Rabin Carp, KMP, Finite
automata string matching)