| Week # | Monday | Wednesday | Friday |
| 1 | Sept 22: no class | Sept 24: Intro [W:preface] | Sept 26: Math Review [W:1-11] |
| 2 | Sept 29: Intro to Eclipse, Visual Stack Applet [T:VSA] | Oct 1: Discrete Math Background [T:DMB] | Oct 3: Asymptotic Analysis I [W:29-50] |
| 3 | Oct 6: Asymptotic Analysis II | Oct 8: ADTs, Lists, Iterators, Queue ADT [W:57-59, 62-67, 91-95] | Oct 10: Trees, BSTs [W:101-122] |
| 4 | Oct 13: AVL Trees [W:123-135] | Oct 15: Memory Hierarchy [W:145-147] | Oct 17: B-Trees [W:147-150] |
| 5 | Oct 20: B-Trees | Oct 22 Midterm 1 | Oct 24: Hashing I [W:169-178] |
| 6 | Oct 27: Hashing II [W:179-187] | Oct 29: Programming Session | Oct 31: Priority Queues, Binary Min Heaps [W:201-210] |
| 7 | Nov 3: Binary Min Heaps [W:210-216] | Nov 5: Sorting I [W:247-263] | Nov 7: Sorting II [W:264-279] |
| 8 | Nov 10: Disjoint Sets [W:293-304] | Nov 12: Disjoint Sets II [W:309-312] | Nov 14: Midterm 2 |
| 9 | Nov 17: Graphs: Representations, Topological Sort [W:317-323] | Nov 19: Topological Sort (cont) | Nov 21: Dijkstra's Algorithm [W:323-338] |
| 10 | Nov 24: Minimum Spanning Trees, Kruskal's Algorithm, Prim's Algorithm [W:349-355] | Nov 26: Application of Graphs to Software Engineering (guest lecture by Dr. Jonathan Jacky) | Nov 28: Day After Thanksgiving Holiday |
| 11 | Dec 1: Image Data Structures [T:IDS] | Dec 3: Project presentations | Dec 5: Project presentations |