COL351: Analysis and Design of Algorithms

Announcements Lecture Quiz on July 26 (venue LH325). Topics: Binary search treees, AVL trees, Heaps, BFS, DFS and shortest paths in graphs.

The class is full and so we are not permitting students to add this course. I am making an exception for students who are in their final year of studies at IITD and have secured and A/A(-) grade in either Data structures or Discrete Maths. If you meet these criterion, please get an application for adding this course signed by me.
Instructor Naveen Garg, 515 Bharti
Text Algorithms Design by Jon Kleinberg and Eva Tardos
Slides for this text book can be found here

Reference Material
Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein, published by MIT Press and McGraw-Hill.
Algorithms by Dasgupta, Papadimitriou and Vazirani
Pat Morin's course on Advanced Data Structures
Lecture Notes on Algorithms by Jeff Erickson, UIUC
Lecture Notes on Algorithms by Sariel Har Peled, UIUC
Course outline (tentative)
Topic Slides
Tentative Dates
DFS, BFS and Applications
edge and strong connectivity

Greedy Algorithms
some examples

Divide and Conquer


Dynamic Programming


Max flow, min cut and applications


NP-completeness, polytime reductions


Tutorials
LH517, 1-2pm on Tue,Wed,Thu
Evaluation Minor1 (20); Minor2 (20); Major (40); Quiz (3X5); Attendance (5)
Attendance/missed tests Policy
If you miss a minor/quiz due to illness (medical certificate needed) then I will scale the marks you receive  in the evaluations to award you marks in the missed minor/quiz. There is no reminor/requiz.
Tutorial Problems
You can find the problems here
Teaching Assistants
Dishant Goyal
<csz178060@iitd.ac.in>
Saurabh Milind Godse
<mcs182019@iitd.ac.in>
Pushkar Singh
<mcs182016@iitd.ac.in>
Aayush Singha Roy
<siy197557@iitd.ac.in>
Arindam  Bhattacharya
<csz168114@iitd.ac.in>