2. Algorithm Efficiency and Asymptotic Notation
3. Analysis of Nonrecursive Algorithms
4. Analysis of Recursive Algorithms
5. Brute force Sorting and String Matching
6.
Brute force Closest Pair and Convex-Hull
8. Binary Search and Tree searches
9. Divide and Conquer Closest Pair and Convex Hull
13. Horner's Rule and Problem Reductions
15. Dynamic Programming Generating Binomial Coefficients
16. Warshall's and Floyd's Algorithm
17. Dynamic Programming and Memory Function
18. Greedy Technique and Prim's Algorithm
19. Kruskal's Algorithm and Dis-joint Sets
22. Maximum Matching in a Bipartite Graph