
| Week 1 | 8/28-8/30 | Chapter 1; Section 4.1 | Abstract data types |
| Week 2 | 9/4-9/6 | Chapter 2 | ADTs continued |
| Week 3 | 9/11-9/13 | Chapter 3 | Recursion; "big O" |
| 9/18 | ROSH HA-SHANAH - NO CLASS | ||
| Week 4 | 9/20-9/25 | Chapter 8 | Linked Structures |
| 9/27 | YOM KIPPUR - NO CLASS | ||
| Week 5 | 10/2-10/4 | Chapter 8, continued | Linked Structures, continued |
| Week 6 | 10/9-10/11 | Chapter 4 | Advanced array types |
| Week 7 | 10/16-10/18 | Chapter 5 | Generic templates |
| Week 8 | 10/23 | REVIEW FOR MIDTERM EXAM | Come prepared with your own questions |
| 10/25 | MIDTERM EXAM | Open book, covers Chaps. 1-5 and Chap. 8 | |
| Week 9 | 10/30-11/1 | Sections 6.1 - 6.5 | Variant records |
| Week 10 | 11/6-11/8 | Sections 7.1-7.6 | Stacks and Queues |
| Week 11 | 11/13-11/15 | Chapter 10 | Directed Graphs |
| 11/15 | Sections 11.1-11.8 | Binary Trees | |
| Week 12 | 11/20 | Sections 11.1-11.8 | Binary Trees, continued |
| 11/22 | THANKSGIVING - NO CLASS | ||
| Week 13 | 11/27-11/29 | Sections 12.1-12.3 | Priority Queues and Heaps |
| Week 14 | 12/4-12/6 | Chapter 14 | Internal Sorts |
| 12/11 (makeup day) | REVIEW FOR FINAL EXAM | Come prepared with your own questions | |
| 12/18 (likely) | FINAL EXAM, 4:00-6:00 PM | Open book, covers all course material |