| 10th Jan, 2005 | Discussion of Syllabus and the requirements: TA Mengke Li |
| 12th Jan, 2005 | Introduction and overview of the course, order statistics problem |
| 14th Jan, 2005 | Simultaneous Min/Max, review of Master theorem, pretest |
| 17th Jan, 2005 | MLK Holiday |
| 19th Jan, 2005 | Selection in Linear time |
| 21st Jan, 2005 | Completed Selection, Lower-bound for sorting |
| 24th Jan, 2005 | Graph Algorithms: BFS and DFS |
| 26th Jan, 2005 | Applications of DFS: Topological Sorting of DAG and Strongly Connected Components |
| 28th Jan, 2005 | Applications of DFS: Strongly Connected Components, MST |
| 31st Jan, 2005 | MST Generic with proof, Kruskal's |
| 02nd Feb, 2005 | Disjoint Set Datastructure-Implimentation of Kruskal |
| 04th Feb, 2005 | Review of Materials so far, loop invariants |
| 07th Feb, 2005 | Heaps and Prim's MST |
| 09th Feb, 2005 | Single Soruce S.P. Bellman-Ford |
| 11th Feb, 2005 | No Lectures: Instructor on Travel |
| 14th Feb, 2005 | Dijkstra's Algorithm |
| 16th Feb, 2005 | Difference constraint LP using SSSP |
| 18th Feb, 2005 | Midterm 1 |
| 21st Feb, 2005 | All Pairs SP Matrix Mult. type algorithm |
| 23rd Feb, 2005 | APSP: Floyd-Warshall |
| 25th Feb, 2005 | Review of Basic Algorithms so far: Flows introduction |
| 28th Feb, 2005 | Network Flows: Basic Ford-Fulkerson |
| 02nd Mar, 2005 | Networkflows: Maxflow-Mincut theorem |
| 04th Mar, 2005 | Edmonds Karp and Application to Matching |
| 07th Mar, 2005 | Dynamic Programming: Matrix Chain Mult. |
| 09th Mar, 2005 | Dynamic Programming: Longest Common Subsequence |
| 11th Mar, 2005 | Dynamic Programming: Optimal Binary Search Trees |
| 14th March, 2005 | Spring Break!! |
| 16th March, 2005 | Spring Break!! |
| 118th March, 2005 | Spring Break!! |
| 21st Mar, 2005 | Theory of NP-Completeness |
| 23rd Mar, 2005 | Theory of NP-Completeness |
| 25rd Mar, 2005 | Review for the Midterm 2 |
| 28th Mar, 2005 | Midterm 2 |
| 30th Mar, 2005 | Reductions CIRCUIT SAT to SAT to 3SAT |
| 01st April, 2005 | More reductions |
| 04th April, 2005 | Still more reductions |
| 06th April, 2005 | Intro to Approximation: vertex cover |
| 08th April, 2005 | Approximation for Eucledian TSP |
| 11th April, 2005 | Hardness of Approximating TSP |
| 13th April, 2005 | Linear Programming introduction |
| 15th April, 2005 | Simplex |
| 18th April, 2005 | Simplex |
| 20th April, 2005 | FFT and Polynomial Multiplication |
| 22nd April, 2005 | FFT and Polynomial Multiplication |
| 25th April, 2005 | Open discussion with the students |
| 27th April, 2005 | Review of Network Flows |
| 29nd April, 2005 | More Review |