| Number | Subject | Slides |
|---|---|---|
| 1 | Introduction | ppt pdf |
| 2 | Asymptotic analysis (Cormen chapter 3) | ppt pdf |
| 3 | Recursions (Cormen chapter 4) | ppt pdf |
| 4 | Quicksort, Comparison-based Sorting (Cormen chapters 7,8) | ppt pdf |
| 5 | Abstract Data Structures (Cormen chapter 10) | ppt pdf |
| 6 | Priority Queues and Heaps (Cormen chapter 6) | ppt pdf |
| 7 | Binary Search Trees and Balanced Trees (Cormen chapter 13) | ppt part 1 ppt part 2 |
| 8 | Hash Tables (Cormen chapter 12) | ppt pdf |
| 9 | Graphs (Cormen chapter 22) | ppt pdf |
| 10 | Minimum Spanning Trees (Cormen chapter 23) | ppt pdf |
| 11 | Strongly Connected Components (Cormen chapter 22.5) | ppt pdf |
| 12 | One Shortest Path (Cormen chapter 24) | ppt pdf |
| 13 | All Shortest Paths (Cormen chapter 25) | ppt pdf |