Data Structures and Algorithms
| Week-Meeting | Lecture | Assignments | Notes |
|---|---|---|---|
| 1-1 | Syllabus | ||
| 1-2 | EOS Overview, Project Template, C++ | Project Template | |
| 1-3 | C++ | Homework 1 | Due January 17th at 8:00 a.m. |
| 2-1 | MLK Holiday, no class | ||
| 2-2 | C++ | ||
| 2-2 | C++ | Understand this code | |
| 2-2 | C++ | ||
| 3-1 | C++ | ||
| 3-2 | C++ | ||
| 3-3 | C++ | Almost Useless Data Structure | Due 2/5/18 at 8:00 a.m. |
| 4-1 | C++ | ||
| 4-2 | Algorithmic Analysis | ||
| 4-3 | Algorithmic Analysis | ||
| 5-1 | Lists, Stacks, and Queues | Project 1 due by 8:00 a.m. | |
| 5-2 | Lists, Stacks, and Queues | ||
| 5-3 | Substitute teacher | ||
| 6-1 | Lists, Stacks, and Queues | ||
| 6-2 | Trees - Generic through BSTs | Stacks and Queues Assignment | Due February 23 by 8:00 a.m. |
| 6-3 | Trees - BSTs (continued) | In class work; creating tree traversal algorithms. | |
| 7-1 | Trees - AVL Trees | ||
| 7-2 | Trees - Red-Black Trees | ||
| 7-3 | Trees | ||
| 8-1 | Hashing | ||
| 8-2 | Hashing | ||
| 8-3 | Midterm | Hashing Assignment | Due 8:00 a.m. Wednesday, March 21st |
| 9-1 | Spring Break | ||
| 9-1 | Spring Break | ||
| 9-1 | Spring Break | ||
| 10-1 | Priority Queues | ||
| 10-2 | Priority Queues | ||
| 10-3 | Sorting | ||
| 11-1 | Sorting | ||
| 11-2 | Sorting | ||
| 11-3 | Sorting | ||
| 12-1 | |||
| 12-2 | |||
| 12-3 | |||
| 13-1 | |||
| 13-2 | |||
| 13-3 | |||
| 14-1 | |||
| 14-2 | |||
| 14-3 | |||
| 15-1 | |||
| 15-2 | |||
| 15-3 | |||
| 16 | Final Exam (not cumulative). |