Design and Analysis of Algorithms

Note: The final exam will be based on material taught from Lectures 17
(Topics : Complexity classes, Lower Bounds, Streaming, Sublinear, Cache Oblivious Algo.)

Problem Set 7 and 8 has been posted.

You can collect your Assignment 3 from the TA (Pradeesha Ashok, Room 112) between 10:30-12:30
on Friday, Dec 5th morning

Here is a list of topics that will be covered in this course:

* Algorithmic Paradigms - Greedy, Divide and Conquer, Dynamic Programming
* Shortest Paths, Minimum Spanning Trees, Maximum Flow
* Randomized Algorithms, Linear Programming, Local Search
* Lower bounds, Complexity Classes NP, Reductions
* Advanced Topics - FPT algo, Cache Oblivious Algo, Streaming and Sublinear Algo

Time and Place

WF 3:30-5:00; L4 in Central Lecture Hall

Instructors:

TAs:

Course Material

Text Book : Algorithm Design, Kleinberg and Tardos

Text Book : Introduction to Algorithms, Cormen et al,