| Week | Dates | Lecture Topics | Assignment | Reading |
| 0 | 1/7 - 1/9 | Register for Classes | ||
| 1 | 1/10 - 1/14 | Class Introduction, Syllabus Depth vs. Breadth Searching (1) |
Ch 12 | |
| 2 | 1/17 - 1/21 | Red-Black Trees (2) | Ch 13 | |
| 3 | 1/24 - 1/28 | B-Trees (3) | HW 1 (1) | Ch 18 |
| 4 | 1/31 - 2/4 | PROJECT WORK DAY | ||
| 5 | 2/7 - 2/11 | Min-Max
(Game) Trees (4) Static State Evaluation |
HW 2 | Handouts |
| 6 | 2/14 - 2/18 | Alpha-beta
Pruning (5) Game Tree Theory |
Handouts | |
| 7 | 2/21 - 2/25 | TEST 1 | ||
| 8 | 2/28 - 3/4 |
Graphs (6) Fri, 3/4 - WITHDRAW DAY |
HW 3 (4) | Ch 22 |
| 3/7 - 3/11 | SPRING BREAK - NO CLASS | |||
| 9 | 3/14 - 3/18 | Minimum Spanning Trees (7) | Ch 23 | |
| 10 | 3/21 - 3/25 | Single-Source Shortest Paths (8) | Ch 24 | |
| 11 | 3/28 - 4/1 | A* Path Searching (9) | HW 4 (7) | Handouts |
| 12 | 4/4 - 4/8 | Simulations (10) | Handouts | |
| 13 | 4/11 - 4/15 | TEST 2 | ||
| 14 | 4/18 - 4/22 | NP-Complete (11) | HW 5 (10) | Ch 34 |
| 15 | 4/27 - 4/29 | Approximation Algorithms (12) | Ch 35 | |
| Finals | 5/2 - 5/6 | FINAL EXAM - Tues, 5/4 6:00pm-8:00pm | HW 6 (12) |
Note - numbers in parenthesis denote mapping to objectives.