The schedule is subject to change by the management at any time.
| Week | Monday | Wednesday | Friday | 1 |
|---|---|---|---|
| 2 |
Jan 16th Martin Luther King Day:No Class |
||
| 3 |
Jan 23rd 6: Sets and MapsRead: Chapter 5.4 - 5.6 |
Jan 25th 7: Introduction to RecursionRead: Chapter 7 |
In: ADTs (Saturday)
Out: Recursion Recursion Jan 27th 8: FractalsRead: Chapter 7.5, 8.4 |
| 4 |
Jan 30th 9: Recursive Backtracking 1Read: Chapter 8.2 - 8.3; 9 |
Feb 1st 10: Recursive Backtracking 2 and Exhaustive SearchRead: Chapter 9 |
Feb 3rd 11: SortingRead: Section 7.5, 10.1, 10.2 SlidesCode |
| 5 |
Feb 6th In: Recursion Recursion
12:
Memoization and Structs, Overview of Tries
Out: Backtracking Read: Chapter 10 |
Feb 8th 13: ClassesRead: Chapter 6 |
Feb 10th 14: PointersRead: Chapter 12 |
| 6 |
Feb 13th 15: Dynamic AllocationRead: Chapter 11 |
Feb 15th 16: Linked ListsRead: Chapter 11 |
In: Backtracking
Out: Patient Queue, Tiles, Heaps Feb 17th 17: Implementing VectorRead: Chapter 12.1 (advanced reading: 14.4) |
| 7 |
Feb 20th Presidents' Day:No Class |
Feb 22nd 18: TreesMidterm: Feb 23rd Read: Chapter 16.1 |
Feb 24th 19: Binary HeapsRead: Assn 5 handout |
| 8 |
Feb 27th 20: Binary Search TreesRead: Chapter 16.1-16.3 |
Mar 1st 21: HashingRead: Chapter 15 |
In: Patient Queue
Out: Binary Trees Mar 3rd 22: Graphs Read: Chapter 18 |
| 9 |
Mar 6th 23: Graphs II: Minimum Spanning TreesRead: Chapter 18 |
Read: Chapter 18.6 |
Read: Chapter 18.6 |
| 10 |
Mar 13th 26: C++ Inheritance and PolymorphismNo reading |
Mar 15th 27: Esoteric Data Structures: Skip Lists and Bloom FiltersNo reading |
In: Trailblazer
Mar 17th 28: Final ClassFinal: March 20th No reading |