Algorithm Design and Analysis (CS60007)

Instructors: Prof. Partha Pratim Chakraborty, and Sourangshu Bhattacharya

Teaching Assistants: Harsh Jain, Yeswanth Kolla, Pracheta Saha, Aman Nasim

Class Schedule: Monday (12:00-12:55) , Tuesday (10:00-11:55) , Thursday (08:00-08:55)

Classroom: NC - 234

Announcements:

First class will be on Monday 20th July.
Grading weightage: Class Tests (30%), Scribing (10%), Mid Semester Examination (30%), Final Examination (30%)

Week	Dates	Topic / Activity	Links / Material
1	20/7/26, 21/7/26 (2 hr), 23/7/26	Recursive Formulations	Introduction Recursive Formulations to Algorithms
2	27/7/26, 28/7/26 (2 hr), 30/7/26	Analysis of Algorithms	Analysis of Algorithms
3	3/8/26, 4/8/26 (2 hr), 6/8/26	Divide and Conquer	Divide and Conquer D&C - Convex Hull D&C - Closest Pair D&C - Median Finding
4	10/8/26, 11/8/26 (2 hr), 13/8/26	Dynamic Programming
5	17/8/26, 18/8/26 (2 hr), 20/8/26	Greedy Choice
6	24/8/26, 25/8/26 (2 hr), 27/8/26	Branch and Bound
7	31/8/26, 1/9/26 (2 hr), 3/9/26	NP-Completeness
8	7/9/26, 8/9/26 (2 hr), 10/9/26	Solving NP-Hard Problems
9	14/9/26, 15/9/26 (2 hr), 17/9/26	Graph Traversal
-	21/9/26, 22/9/26 (2 hr), 24/9/26	Mid Semester Examination
-	28/9/26, 29/9/26 (2 hr), 1/10/26	Mid Semester Examination
10	5/10/26, 6/10/26 (2 hr), 8/10/26	DFS for Graphs
11	12/10/26, 13/10/26 (2 hr), 15/10/26	Minimal Spanning Tree
12	19/10/26, 20/10/26 (2 hr), 22/10/26	Union-Find Data Structure
13	26/10/26, 27/10/26 (2 hr), 29/10/26	Shortest Paths
14	2/11/26, 3/11/26 (2 hr), 5/11/26	Maxflow
15	9/11/26, 10/11/26 (2 hr), 12/11/26	Ford-Fulkerson

Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
Algorithm Design by Jon Kleinberg, Eva Tardos
Algorithms by Dasgupta, Papadimitriou, and Vazirani
Approximation Algorithms by Vijay V. Vazirani
Randomized Algorithms by Rajeev Motwani, Prabhakar Raghavan
Probability and Computing by Michael Mitzenmacher and Eli Upfal