| Date | Reading and Assignment | Agenda |
| Aug 28 Mon | Chapter 0 | Introduction |
| Aug 30 Wed | Induction, Algorithmic Efficiency | |
| Sep 01 Fri | Read Ch 1 (omit 1.5) | Fibonacci Numbers, Big-O and friends |
| Sep 04 Mon | Labor Day -- No Class | |
| Sep 06 Wed | HW #1 Due | Addition, Multiplication, Modular Arithmetic |
| Sep 08 Fri | Modular Exponentiation, Euclid's Algorithm | |
| Sep 11 Mon | Euclid's Extended Algorithm | |
| Sep 13 Wed | HW #2 Due | Modular Division, Fermat's Little Theorem |
| Sep 15 Fri | Primality Testing, Generating Large Primes | |
| Sep 18 Mon | Read Ch 2 (omit 2.6) | Cryptography, RSA |
| Sep 20 Wed | RSA continued | |
| Sep 22 Fri | Divide-and-Conquer: multiplying integers, the Master Theorem | |
| Sep 25 Mon | HW #3 Due | Mergesort, Selection |
| Sep 27 Wed | Read Ch 3 | Finish Selection, Start Graphs |
| Sep 29 Fri | Depth-First Search | |
| Oct 2 Mon | Read Ch 4 | DFS on Digraphs and DAGs |
| Oct 4 Wed | H/W #4 due | Strongly-Connected Components |
| Oct 6 Fri | Breadth-First Search | |
| Oct 9 Mon | Shortest-Paths, Dijkstra's Algorithm | |
| Oct 11 Wed | H/W #5 due | MT Review Session |
| Oct 13 Fri | Midterm | |
| Oct 16 Mon | Return Midterm; Solns | |
| Oct 18 Wed | Finish Dijkstra's Alg | |
| Oct 20 Fri | Read Ch 5 (Omit 5.3) | Bellman-Ford, Negative-weight cycles |
| Oct 23 Mon | Shortest/Longest Paths in a dag | |
| Oct 25 Wed | Greedy intro, Minimum Spanning Trees, Kruskal's Algorithm | |
| Oct 27 Fri | Disjoint Sets, The Cut Property, Prim's Algorithm | |
| Oct 30 Mon | Read Ch. 6 | Finish Prim's, Huffman Codes |
| Nov 1 Wed | H/W #6 due | Set Cover Approximation |
| Nov 3 Fri | Proof of Approximation Bound for Set Cover; HW #7 discussion | |
| Nov 6 Mon | Intro to Dynamic Programming, Longest Inc Subsequences | |
| Nov 8 Wed | H/W #7 due | Edit Distance |
| Nov 10 Fri | Knapsack | |
| Nov 13 Mon | Matrix-Chain Multiplication | |
| Nov 15 Wed | H/W #8 Due | All-Pairs Shortest Paths (Floyd-Warshall) |
| Nov 17 Fri | No Class | |
| Nov 20 Mon | No Class | |
| Nov 22 Wed | No Class | |
| Nov 24 Fri | No Class | |
| Nov 27 Mon | Read Ch. 8 | Traveling Salesman Problem |
| Nov 29 Wed | Independent Sets | |
| Dec 01 Fri | ||
| Dec 04 Mon | ||
| Dec 06 Wed | H/W #9 Due | |
| Dec 08 Fri |