Week | Topics | Slides | Pre-recorded Videos | Other Material | Reading |
Week-01 (28 Sep - 03 Oct) |
01. Introduction: Analysing algorithms 02. Graph Algorithms: Why graphs? 03. Graph Algorithms: Graph representations |
01. [PDF] 02. [PDF] 03. [PDF] |
[Youtube-01 (Start from 44:00:00)] [Youtube-02] |
Logistics (PDF) | Chapter 0 |
Week-02 (05 Oct - 10 Oct) |
04. Graph Algorithms: Reachability 05. Graph Algorithms: Undirected connectivity 06,07. Graph Algorithms: DFS |
04. [PDF] 05. [PDF] 06,07. [PDF] |
[Youtube-03] [Youtube-04] [Youtube-05] [Youtube-06] |
Chapter 3 | |
Week-03 (12 Oct - 17 Oct) |
08. Graph Algorithms: Max bandwidth | 08. [PDF] | [Youtube-07] | ||
Week-04 (19 Oct - 24 Oct) |
09-11. Graph Algorithms: BFS, Dijkstra | 09-11. [PDF] |
[Youtube-08] [Youtube-09] |
Chapter 4 | |
Week-05 (26 Oct - 31 Oct) |
12. Greedy Algorithms: Introduction 13-14. Greedy Algorithms: Scheduling |
12. [PDF] 13-14. [PDF] |
[Youtube-10] [Youtube-11] |
Chapter 5 | |
Week-06 (02 Nov - 07 Nov) |
15-16. Greedy Algorithms: MST | 15-16. [PDF] | [Youtube-12] [Youtube-13] [Youtube-14] |
||
Week-07 (09 Nov - 14 Nov) |
|||||
Week-08 (16 Nov - 21 Nov) |
17. Divide and Conquer: Multiplication 18. Divide and Conquer: Master Theorem |
17. [PDF] 18. [PDF] |
[Youtube-15] [Youtube-16] |
Chapter 2 | |
Week-09 (23 Nov - 28 Nov) |
19. Divide and Conquer: Sorting and Selection 20. Divide and Conquer: More Examples 21. Dynamic Programming: Backtracking |
19. [PDF] 20. [PDF] 21. [PDF] |
[Youtube-17] [Youtube-18] [Youtube-19] |
Chapter 9, 6 | |
Week-10 (14 Dec - 19 Dec) |
22. Dynamic Programming: I 23. Dynamic Programming: II |
22. [PDF] 23. [PDF] |
[Youtube-20] | Chapter 9, 6 | |
Week-11 (21 Dec - 26 Dec) |
24. Dynamic Programming: String Algorithms 25. Network Flow: Ford-Fulkerson-I 26. Network Flow: Ford-Fulkerson-II |
24. [PDF] 25. [PDF] 26. [PDF] |
[Youtube-21] | ||
Week-12 (28 Dec - 02 Jan) |
27. Network Flow: Applications | 27. [PDF] |