| 1 | Overview of the course | PDF unavailable |
| 2 | Framework for Algorithms Analysis | PDF unavailable |
| 3 | Algorithms Analysis Framework - II | PDF unavailable |
| 4 | Asymptotic Notations | PDF unavailable |
| 5 | Algorithm Design Techniques : Basics | PDF unavailable |
| 6 | Divide And Conquer-I | PDF unavailable |
| 7 | Divide And Conquer -II Median Finding | PDF unavailable |
| 8 | Divide And Conquer -III Surfing Lower Bounds | PDF unavailable |
| 9 | Divide And Conquer -IV Closest Pair | PDF unavailable |
| 10 | Greedy Algorithms -I | PDF unavailable |
| 11 | Greedy Algorithms - II | PDF unavailable |
| 12 | Greedy Algorithms - III | PDF unavailable |
| 13 | Greedy Algorithms - IV | PDF unavailable |
| 14 | Pattern Matching - I | PDF unavailable |
| 15 | Pattern Matching - II | PDF unavailable |
| 16 | Combinational Search and Optimization I | PDF unavailable |
| 17 | Combinational Search and Optimization II | PDF unavailable |
| 18 | Dynamic Programming | PDF unavailable |
| 19 | Longest Common Subsequences | PDF unavailable |
| 20 | Matrix Chain Multiplication | PDF unavailable |
| 21 | Scheduling with Startup and Holding Costs | PDF unavailable |
| 22 | Average case Analysis of Quicksort | PDF unavailable |
| 23 | Bipartite Maximum Matching | PDF unavailable |
| 24 | Lower Bounds for Sorting | PDF unavailable |
| 25 | Element Distinctness Lower Bounds | PDF unavailable |
| 26 | NP-Completeness-I -Motivation | PDF unavailable |
| 27 | NP - Completeness - II | PDF unavailable |
| 28 | NP-Completeness - III | PDF unavailable |
| 29 | NP-Completeness - IV | PDF unavailable |
| 30 | NP-Completeness - V | PDF unavailable |
| 31 | NP-Completeness - VI | PDF unavailable |
| 32 | Approximation Algorithms | PDF unavailable |
| 33 | Approximation Algorithms | PDF unavailable |
| 34 | Approximation Algorithms for NP | PDF unavailable |