| Week | Date | Lecture Topic | Reading | Work Out | Work Due |
| 1 | Jan 11 | Introduction | Chapter 0 | ||
| Jan 13 | Big-O, Omega, and Theta, Experimental measurement of algorithms | Chapter 0 | Chapter 0 | ||
| Jan 15 | Arithmetic Algorithms | Chapter 1.1 | Chapter 1 | ||
| 2 | Jan 18 | Martin Luther King Jr. Holiday | |||
| Jan 20 | Modular Arithmetic Algorithms | Chapter 1.2 | |||
| Jan 22 | Primality Testing | Chapter 1.3 | Chapter 0 | ||
| 3 | Jan 25 | Cryptography | Chapter 1.4 | ||
| Jan 27 | Hashing | Chapter 1.5 | |||
| Jan 29 | Divide and Conquer, Multiplication | Chapter 2.1 | Chapter 2 | ||
| 4 | Feb 01 | Recurrence Relations | Chapter 2.2 | Chapter 1 | |
| Feb 03 | Mergesort | Chapter 2.3 | |||
| Feb 05 | Medians and Matrix Multiplication | Chapter 2.4 and 2.5 | |||
| 5 | Feb 08 | FFT | Chapter 2.6 | ||
| Feb 10 | Completion of FFT | Chapter 2.6 | Chapter 2 | ||
| Feb 12 | Midterm Exam I | Chapter 0, 1, 2 | |||
| 6 | Feb 15 | President's Day Holiday | |||
| Feb 17 | Graphs and Representations | Chapter 3.1 | Chapter 3 | ||
| Feb 19 | Depth First Search and Connectivity | Chapter 3.2 | |||
| 7 | Feb 22 | Directed Graph Search | Chapter 3.3 | ||
| Feb 24 | Strongly Connected Components. | Chapter 3.4 | |||
| Feb 26 | Paths, Distances, BFS | Chapter 4.1 and 4.2 | Chapter 4 | Chapter 3 | |
| 8 | Mar 01 | Dijkstra's Algorithm | Chapter 4.3 and 4.4 | ||
| Mar 03 | Arrays vs. Heaps for Priority Queues | Chapter 4.5 | |||
| Mar 05 | Negative Edges, Bellman-Ford, Paths in DAGs | Chapter 4.6, 4.7 | |||
| Mar 08 | Semester Break | ||||
| Mar 10 | Semester Break | ||||
| Mar 12 | Semester Break | ||||
| 9 | Mar 15 | Minimum Spanning Trees, Cut Property, Kruskal's Algorithm | Chapter 5.1 | Chapter 5 | Chapter 4 |
| Mar 17 | Disjoint Sets, Prim's Algorithm | Chapter 5.1 | |||
| Mar 19 | Huffman Encoding | Chapter 5.2 | |||
| 10 | Mar 22 | Horn Formulas | Chapter 5.3 | ||
| Mar 24 | Set Cover | Chapter 5.4 | Chapter 5 | ||
| Mar 26 | Midterm Exam II | Chapter 3, 4, 5 | |||
| 11 | Mar 29 | Dynamic Programming | Chapter 6 | Chapter 6 | |
| Mar 31 | Dynamic Programming | Chapter 6 | |||
| Apr 02 | Dynamic Programming | Chapter 6 | |||
| 12 | Apr 05 | Dynamic Programming | Chapter 6 | ||
| Apr 07 | Dynamic Programming | Chapter 6 | |||
| Apr 09 | Dynamic Programming | Chapter 6 | |||
| 13 | Apr 12 | Linear Programming and Reductions | Chapter 7 | Chapter 7 | Chapter 6 |
| Apr 14 | Linear Programming and Reductions | Chapter 7 | |||
| Apr 16 | Linear Programming and Reductions | Chapter 7 | |||
| 14 | Apr 19 | Linear Programming and Reductions | Chapter 7 | ||
| Apr 21 | Linear Programming and Reductions | Chapter 7 | |||
| Apr 23 | Linear Programming and Reductions | Chapter 7 | |||
| 15 | Apr 26 | Chapter 8-9 | Chapter 7 | ||
| Apr 28 | Chapter 10 | ||||
| 16 | May 05 | Final Exam (7:30 a.m. - 9:30 a.m.) | |||
| May 07 | Commencement |



