COL351: Analysis and Design of Algorithms

Instructor Naveen Garg, 515 Bharti
Text Algorithms Design by Jon Kleinberg and Eva Tardos
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

    24, 25, 27, 31 July
    Greedy Algorithms

    Divide and Conquer

    Dynamic Programming

    Max flow, min cut and applications

    NP-completeness, polytime reductions

    LH526, 2-3pm on Mon,Tue,Thu
    Evaluation Minor1 (20); Minor2 (20); Major (40); Quiz (10); 3 surprise lecture quizzes, best 2 to be counted, weightage of 5 marks each
    Attendance/missed tests Policy
    If you miss a minor due to illness (medical certificate needed) then I will scale the marks you receive  in the other minors and major to award you marks in the missed minor. There is no reminor. If you miss a lecture quiz there is no possibility of compensating it.