The following schedule is subject to change based on the progress of the class.
| Date | Topic | Activity | Assignment Due |
|---|---|---|---|
| 9/4 | Introduction | Review Open Data Structures intro | A0, due 9/8 |
| 9/9 | Arrays & Index Access | Read Bullinaria's notes, ch. 2 | A1, due 9/15 |
| 9/11 | Sequence Operations | Read Think Java ch. 7 | |
| 9/16 | Linked Lists | A2, due 9/22 | |
| 9/18 | List Add & Remove | ||
| 9/23 | Iterators | A3, due 9/29 | |
| 9/25 | Exceptions & List Wrapup | ||
| 9/30 | Stacks, Queues, Deques | A4, due 10/6 | |
| 10/2 | SQD Implementation | ||
| 10/7 | Recursion | A5, due 10/20 | |
| 10/9 | Recursion (again!) | ||
| 10/14 | F A L L B R E A K | ||
| 10/16 | Sorting | Midterm #1 at Science Center | |
| 10/21 | Maps & Tables | A6, due 10/27 | |
| 10/23 | Hash Table Implementation | ||
| 10/28 | Binary Trees | A7, due 11/3 | |
| 10/30 | Binary Search Trees | ||
| 11/4 | Tree Implementations | A8, due 11/10 | |
| 11/6 | C R O M W E L L D A Y | ||
| 11/11 | Heaps | A9, due 11/17 | |
| 11/13 | Tree Wrapup | ||
| 11/18 | Graph Definitions | A10, due 11/24 | |
| 11/20 | Graph Implementations | ||
| 11/25 | Graph Traversal | ||
| 11/27 | T H A N K S G I V I N G | ||
| 12/2 | Shortest Path | A11, due 12/8 | |
| 12/4 | (Extra day for Mountain Day / catchup) | Midterm #2 at Science Center | |
| 12/9 | Final Exam / Semester Review | ||
| 12/11 | Demo Day | ||