| Date | Topic | Required Reading | Assignments | Suppl. Material | |
|---|---|---|---|---|---|
| Aug 29 | Overview, Java | W 1.4-1.6 | |||
| Sept 3 | Math | W 1.2 | |||
| Sept 5 | Asympotic analysis | W 2 | |||
| Sept 10 | CVS / Ant, Lists I | W 2, W3.1-3.5 | P0 out | CVS book | |
| Sept 12 | List II | W 3.1-3.5 | HW1 out | ||
| Sept 17 | Stacks / Queues | W 3.6-3.7 | P0 due, P1 out | ||
| Sept 19 | Tree Intro | W 4.1-4.2 | HW1 due, HW2 out | ||
| Sept 24 | Binary Search Tree | W 4.3 | Project grading guideline | ||
| Sept 26 | Binary Search Tree | mid-term review | |||
| Oct 1 | Red black trees | W 12.2 | HW2 due, P1 due | ||
| Oct 3 | MIDTERM 1 (Overview-BST) | ||||
| Oct 8 | Red black trees | W 12.2 | P2 out; Check course home for updates. | ||
| Oct 10 | Red-black trees | W 12.2 | HW3 out; Red-black tree solution out | ||
| Oct 15 | Priority queues (Shawn Lupoli lecture) | W 6.1-6.6 | Jian @ IEEE VIS; Lecture slides | ||
| Oct 17 | Priority queues (Shawn Lupoli lecture) | W 6.1-6.6 | HW3 Due; HW4 out | Jian @ IEEE VIS | |
| Oct 22 | B-Trees | W 4.7 | P2 due, P3 out | ||
| Oct 24 | B-Trees | W 4.7 | HW4 due; HW5 out | ||
| Oct 29 | Hashing | W 5 | mid-term II review | ||
| Oct 31 | Hashing | W 5 | HW 5 due (by 4pm) | ||
| Nov 5 | Hws, Midterm II review | P3 due | |||
| Nov 7 | MIDTERM 2 (RBT-Hashing) | ||||
| Nov 12 | Midterm 2 explained | p4 out | |||
| Nov 14 | Threads 1 | Readings | HW6 out | ||
| Nov 19 | Threads 2 | ||||
| Nov 21 | Disjoint Sets | W 8 | HW6 due | ||
| Nov 26 | Disjoint Sets | P4 due | |||
| Nov 28 | Happy Thanksgiving! | ||||
| Dec 3 | Graphs | W 9.1-9.3, 9.6 | p5 out | We only have one week for this proj. Start early! | |
| Dec 5 | Graphs | Final exam review | |||
| Dec 10 | p5 due | ||||
| Dec 17 | 3:30-4:45 FINAL EXAM | (this room!) | |||