| Lecture | Date | Topic | Reading | Comments |
| 0 | Friday, 06 February 2004 | Course introduction via algorithms for finding largest sum of any subsequence. | hw 0 | |
| 1 | Monday, 09 February 2004 | Introduction to asymptotic analysis. | CLRS pages 41-50. | hw0 solutions |
| 2 | Wednesday, 11 February 2004 | Induction, recurrence relations. | CLRS pages 62-84. | |
| 3 | Friday, 13 February 2004 | Divide and Conquer | CLRS pages 15-37; 735-741 | hw1 assigned |
| 4 | Monday, 16 February 2004 | More Divide and Conquor, Loop Invariants | CLRS pages 145-158. | |
| 5 | Wednesday, 18 February 2004 | Loop Invariants for proving program correctness (using Bubblesort and Quicksort) | ||
| Winter Carnival | Friday, 20 February 2004 |
hw1 due. hw2 assigned. |
||
| 6 | Monday, 23 February 2004 | Heaps, Heapsort. | CLRS pages 127--145 | |
| 7 | Wednesday, 25 February 2004 | Lower Bounds, Decision Trees | CLRS 165-168 | |
| 8 | Friday, 27 February 2004 | Sorting in linear time. | CLRS 168-180 |
hw 2 due hw 3 assigned |
| 9 | Monday, 01 March 2004 | Radix Sort; Binary Search trees | CLRS 170-173, 253-264 | |
| 10 | Wednesday, 03 March 2004 | Average height of a binary search tree built with n keys in random order | Pages 265-268 | |
| 11 | Friday, 05 March 2004 | Graphs, BFS | CLRS pages 527-540 |
hw 3 due hw 4 assigned |
| 12 | Monday, 08 March 2004 | Graphs, DFS, Topological Sort; | ||
| 13 | Wednesday, 10 March 2004 | |||
| 14 | Friday, 12 March 2004 | Minimum spanning trees. | Pages 562--579 | Take-home midterm handed out. Collected on Tuesday, 16 March 2004 by 12.00 |
| 15 | Monday, 15 March 2004 | Single-source, shortest path. | Pages 580--619 | hw 5 available. |
| 16 | Wednesday, 17 March 2004 | Correctness of Dijkstra's algorithm | ||
| 17 | Friday, 19 March 2004 | Characteristic equations, and characteristic polynomials for solving recurrences exactly. | Class notes... | hw 5 due |
| 20 March 2004 - 4 April 2004: Spring break | ||||
| 18 | Monday, 5 April 2004 | Maximum Flow Networks | Pages 643--669 | hw 6 assigned |
| 19 | Wednesday, 7 April 2004 | Maximum Flow Networks | Pages 643--669 | |
| 20 | Friday, 9 April 2004 | Maximum Flow Networks | ||
| 21 | Monday, 12 April 2004 | Dynamic Programming | Pages 323-370 | hw 6 due; hw 7 assigned |
| 22 | Wednesday, 14 April 2004 | Dynamic Programming | Pages 323-370 | |
| 23 | Friday, 16 April 2004 | Dynamic Programming | Pages 323-370 | |
| 24 | Monday, 19 April 2004 | Dynamic Programming | Pages 323-370 | hw 7 due; hw 8 assigned |
| 25 | Wednesday, 21 April 2004 | Greedy Algorithms, Activity Selection | Pages 370-384 | |
| 26 | Friday, 23 April 2004 | Greedy Algorithms, Prefix-Free codes | Pages 385-392 | |
| 27 | Monday, 26 April 2004 | RSA, Fermat's little theorem | hw 8 due; hw 9 assigned | |
| 28 | Wednesday, 28 April 2004 | Introduction to Complexity Theory | 966-1021 | |
| 29 | Friday, 30 April 2004 | Complexity Theory, Reductions | 966-1021 | |
| 30 | Monday, 03 May 2004 | NP-Completness | hw 9 due; hw 10 assigned | |
| 31 | Wednesday, 05 May 2004 | Approximation Algorithms | 1022-1056 | |
| 32 | Friday, 07 May 2004 | Complexity Theory | ||