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