Lectures
Lecture schedule subject to changes announced in class
Lecture notes are provided as PPT files. Printing the PPT slides before class as “Handouts,” three per page, with “comment pages” makes it easy to follow along and take notes at the same time. See below for texbook reading suggestions for each class.
| Week # | Week of | Monday | Tuesday | Wednesday | Thursday | Notes |
|---|---|---|---|---|---|---|
| 1 | Aug 29 | Intro | Intro | |||
| 2 | Sep 5 | Labor Day | Java Review | Java Review | CVS / Ant | |
| 3 | Sep 12 | CVS / Ant |
Math Review
Asymptotic Analysis |
Math Review
Asymptotic Analysis |
Asymptotic Analysis | HW 1 Out Proj 0 Out |
| 4 | Sep 19 | Asymptotic Analysis | Lists | Lists | Stacks/Queues | HW 1 Due Proj 0 Due Proj 1 Out |
| 5 | Sep 26 | Stacks/Queues | Tree Intro | Tree Intro | BST | HW 2 Out |
| 6 | Oct 3 | BST | BST | BST | Exam 1 | HW 2 Due Proj 1 Due |
| 7 | Oct 10 | Exam 1 | Splay Trees | Splay Trees | RBT | Proj 2 Out |
| 8 | Oct 17 | RBT | RBT | RBT | Priority Queues | HW 3 Out Proj 2 Due Proj 3 Out |
| 9 | Oct 24 | Priority Queues | Priority Queues | Priority Queues | K-d Trees | HW 3 Due HW 4 Out |
| 10 | Oct 31 | K-d Trees | B-Trees | B-Trees | B-Trees | HW 4 Due |
| 11 | Nov 7 | B-Trees | Exam 2 | Exam 2 | Treaps | |
| 12 | Nov 14 | Treaps | Skip Lists | Skip Lists | Hashing | HW 5 Out |
| 13 | Nov 21 | Hashing | Hashing | Hashing | Thanksgiving | HW 5 Due Proj 4 Out |
| 14 | Nov 28 | Disjoint Sets | Disjoint Sets | Graphs | Graphs | Proj 3 Due |
| 15 | Dec 5 | Graphs | Graphs | Graphs | Graphs | HW 6 Out |
| 16 | Dec 12 | Guest Speakers | Guest Speakers | HW 6 Due Proj 4 Due |
||
| 17 |
Readings
Suggested readings from the Mark Allen Weiss textbook.| Topic | Reading |
|---|---|
| Java Review | Section 1.5 |
| Math Review | Section 1.2 |
| Asymptotic Analysis | Chapter 2 |
| Lists, Stacks, Queues | Chapter 3 |
| Tree Intro and BSTs | Section 4.1 - 4.3 |
| Splay Trees | Section 4.5 |
| Red-Black Trees (RBTs) | Section 12.2 |
| Priority Queues (PQs) and Heaps | Section 6.1 - 6.6 |
| k-D Trees | Section 12.6 |
| B-Trees | Section 4.7 |
| Treaps | Section 12.5 |
| Skip Lists | Section 10.4.2 |
| Hashing | Chapter 6 |
| Disjoint Sets | Chapter 8 |
| Graphs | Section 9.1 - 9.3, 9.6 |