| Week | Topics | Slides | Other material | Reading |
| Week-01 (22 July - 26 July) |
Introduction: Analysing algorithms, asymptotic worst-case analysis |
PDF |
|
Chapter-0 (DPV) |
| Week-02 (31 July - 04 Aug) |
Graph Algorithms Algorithmic mining using DFS |
PDF |
Chapter-3 (DPV) | |
| Week-03 (12 Aug - 16 Aug) |
Algorithmic mining using DFS Graph Algorithms: BFS, Dijkstra |
PDF |
Chapter-3,4 (DPV) | |
| Week-04 (19 Aug - 23 Aug) |
Graph Algorithms: Dijkstra's Greedy algorithms: Introduction |
|
Chapter-4,5 (DPV) | |
| Week-05 (26 Aug - 31 Aug) |
Greedy algorithms: Event scheduling Greedy algorithms: Kruskal |
PDF |
Chapter-5 (DPV) | |
| Week-06 (02 Sep - 06 Sep) |
Greedy algorithms: Kruskal using DSDS DSDS with path compression Divide and Conquer: Introduction |
PDF |
Chapter-2 (DPV) | |
| Week-07 (09 Sep - 13 Sep) |
Divide and Conquer: Karatsuba Divide and Conquer: Master Theorem, Toom-Cook extension |
Chapter-2 (DPV) | ||
| Week-08 (16 Sep - 20 Sep) |
Divide and Conquer: DnC on trees and computational geometry Divide and Conquer: Selection, Median of Medians |
Chapter-2 (DPV) | ||
| Week-09 (23 Sep - 27 Sep) |
Backtracking: MIS, 3-Coloring Dynamic Programming: Weighted scheduling, LIS |
Chapter-2,9,6 (DPV) | ||
| Week-10 (30 Sep - 04 Oct) |
Dynamic Programming: Weighted scheduling, LIS |
Chapter-6 (DPV) | ||
| Week-11 (14 Oct - 18 Oct) |
Dynamic Programming: LIS, LCS, RNA folding Network Flow: Ford Fulkerson |
Chapter-7 (DPV) | ||
| Week-12 (21 Oct - 25 Oct) |
Network Flow: Ford Fulkerson, Applications |
Chapter-7 (DPV) | ||
| Week-13 (28 Oct - 01 Nov) |
Network Flow: Applications |
PDF |
Chapter-7 (DPV) | |
| Week-14 (04 Nov - 08 Nov) |
Computational Intractability: Polynomial-time reduction, NP |
Chapter-8 (KT) | ||
| Week-15 (11 Nov - 15 Nov) |
Computational Intractability: NP-complete/hard problems |
PDF |
Chapter-8 (KT) |