| Date | Reading and Assignment | Agenda |
| Jan 14 Wed | Chapter 0 | Introduction |
| Jan 16 Fri | Chapter 1, Omit 1.5 | Fibonacci Numbers, Complexity |
| Jan 19 Mon | MLK Day -- No Class | |
| Jan 21 Wed | Big-O and friends, Computer Arithmetic | |
| Jan 23 Fri | H/W #1 Out | More Computer Arithmetic |
| Jan 26 Mon | Modular Exponentiation | |
| Jan 28 Wed | Euclid's Algorithm, Modular Inverses | |
| Jan 30 Fri | Euclid's Extended Algorithm and Modular Division | |
| Feb 2 Mon | Primality Testing, Fermat's Little Theorem | |
| Feb 4 Wed | HW 1 due; HW 2 out; Read Ch 2 (omit 2.6) | Generating Large Primes, Intro to Cryptography |
| Feb 6 Fri | RSA | |
| Feb 9 Mon | Divide and Conquer | |
| Feb 11 Wed | Recurrences and the Master Theorem | |
| Feb 13 Fri | Selection | |
| Feb 16 Mon | HW #2 Due | Review |
| Feb 18 Wed | Midterm I | |
| Feb 20 Fri | Graphs | |
| Feb 23 Mon | Read Ch. 3, HW #3 out | DFS |
| Feb 25 Wed | DFS on Digraphs and DAGs | |
| Feb 27Fri | Cycles and Topological Sort | |
| Mar 2 Mon | Strongly-Connected Components | |
| Mar 4 Wed | Read Ch 4 | BFS, Shortest-Paths |
| Mar 6 Fri | Dijkstra's Algorithm | |
| Mar 9 Mon | Finish Dijkstra's Algorithm, Bellman-Ford | |
| Mar 11 Wed | HW #3 Due; HW #4 Out | Negative-weight cycles, SPs in a DAG, Longest Path |
| Mar 13 Fri | Read Ch 5 (Omit 5.3) | Greedy Algorithms, MSTs |
| Mar 16Mon | Kruskal's Algorithm | |
| Mar 18 Wed | Disjoint Sets, Prim's Algorithm | |
| Mar 20 Fri | Compression, Huffman Codes | |
| Mar 23 Mon | Spring Break -- No Class | |
| Mar 25 Wed | Spring Break -- No Class | |
| Mar 27 Fri | Spring Break -- No Class | |
| Mar 30 Mon | Finish Huffman Codes | |
| Apr 01 Wed | Set Cover | |
| Apr 03 Fri | Class canceled -- Illness | |
| Apr 06 Mon | HW #4 Due | Midterm II Review |
| Apr 08 Wed | Midterm II | |
| Apr 10 Fri | Read Ch 6 | Introduction to Dynamic Programming |
| Apr 13 Mon | Longest Increasing Subsequences | |
| Apr 15 Wed | HW #5 out | Edit Distance |
| Apr 17 Fri | Knapsack | |
| Apr 20 Mon | Finish Knapsack | |
| Apr 22 Wed | Matrix Chain Multiplication | |
| Apr 24 Fri | Introduction to NP Completeness; SAT | |
| Apr 27 Mon | More NP-Hard problems | |
| Apr 29 Wed | HW #5 due | Reductions |
| May 01 Fri | Final Review | |
| May 05 Tue | Final Exam | 1:30pm-4pm, Regular Classroom, Comprehensive |