| Week | Topics | Slides | Other material | Reading |
| Week-01 (03 Aug - 05 Aug) |
Introduction: Analysing algorithms, asymptotic worst-case analysis |
PDF |
|
Chapter 0 |
| Week-02 (08 Aug - 12 Aug) |
Introduction: Asymptotic worst-case analysis Graph Algorithms |
PDF |
Chapter 3 | |
| Week-03 (15 Aug - 18 Aug) |
Graph Algorithms: DFS |
Chapter 3 | ||
| Week-04 (2 Aug - 26 Aug) |
Graph algorithms: Algorithmic mining | Chapter 3 | ||
| Week-05 (29 Aug - 02 Sep) |
Graph Algorithms: Max. Bandwidth Path Graph Algorithms: Shortest Path |
PDF |
Chapter 4 | |
| Week-06 (5 Sep - 9 Sep) |
Greedy algorithms: Introduction Greedy algorithms: Scheduling |
PDF |
Chapter 5 | |
| Week-07 (12 Sep - 16 Sep) |
Greedy algorithms: Kruskal, DSDS data structure Divide and Conquer: Karatsuba |
PDF |
Chapter 5, 4 | |
| Week-08 (19 Sep - 23 Sep) |
Divide and Conquer: Master Theorem, Trees, Computational Geometry Divide and Conquer: Sorting and Selection |
PDF |
Chapter 2 | |
| Week-09 (26 Sep - 30 Sep) |
Backtracking and DP: Maximum Independent Set | Chapter 9, 6 | ||
| Week-10 (10 Oct - 15 Oct) |
Dynamic Programming: Case studies | Chapter 6 | ||
| Week-11 (17 Oct - 21 Oct) |
Dynamic Programming: Case studies Network Flow: Ford Fulkerson |
Chapter 7 | ||
| Week-12 (24 Oct - 28 Oct) |
Network Flow: Ford-Fulkerson, Applications | Chapter 7 | ||
| Week-13 (31 Oct - 04 Nov) |
Network Flow: Ford-Fulkerson, Applications | Chapter 7 | ||
| Week-14 (07 Nov - 11 Nov) |
Computational intractability: |