Lecture Notes

1. Introduction and PRELIMINARIES
2. The Growth of Functions
3. Recurrences
4. Graphs
5. DFS Traversal
6. BFS Traversal
7. Trees
8. Union of disjoint sets and finding the partition
9. Lists
10. Stacks and Queues
11. Priority Queues
12. Heaps and Heap Sort
13. Divide and Conquer Technique
14. Sorting Algorithms
15. Greedy Programming Technique
16. Huffman Encoding
17. Minimum Spanning Trees
18. Single Source Shortest Path
19. Topological Sort
20. Dynamic Programming
21. Transitive closure and other Graph algorithms
22. Pattern Matching
23. P and NP