| Week | Dates | Lecture Topics | Assignment | Reading |
| 1 | 1/8 - 1/10 | No class - we only meet on Tues | ||
| 2 | 1/13 - 1/17 | Class Introduction, Syllabus Depth vs. Breadth Searching |
Ch 12 | |
| 3 | 1/20 - 1/24 | Red-Black Trees | Ch 13 | |
| 4 | 1/27 - 1/31 | B-Trees | HW 1 | Ch 18 |
| 5 | 2/3 - 2/7 | Min-Max
(Game) Trees Static State Evaluation |
Handouts | |
| 6 | 2/10 - 2/14 | Alpha-beta
Pruning Game Tree Theory |
Handouts | |
| 7 | 2/17 - 2/21 | TEST 1 | HW 2 | |
| 8 | 2/24 - 2/28 | Graphs | Ch 22 | |
| Fri, 2/28 - WITHDRAW DAY | ||||
| 3/3 - 3/7 | SPRING BREAK - NO CLASS | |||
| 9 | 3/10 - 3/14 | Minimum Spanning Trees | Ch 23 | |
| 10 | 3/17 - 3/21 | Single-Source Shortest Paths | Ch 24 | |
| 11 | 3/24 - 3/28 | A* Path Searching | Handouts | |
| 12 | 3/31 - 4/4 | Simulations | HW3 | Handouts |
| 13 | 4/7 - 4/11 | Project Work - No Class | ||
| 14 | 4/14 - 4/18 | TEST 2 | HW 4 | |
| 15 | 4/21 - 4/25 | NP-Complete | Ch 34 | |
| 16 | 4/28 - 5/2 | Approximation Algorithms | Ch 35 | |
| Finals | 5/2 - 5/7 | FINAL EXAM - Wed, 5/7 8:30pm-10:30pm | HW 5 |