| Week | Mon. | Wed. | Fri. | HWx (due after weekend) |
|---|---|---|---|---|
| 1 | 1/10 | 1/12 | 1/14 | |
| Review | Syllabus [v] | Data/Functions [v] | Classes [v] | |
| 2 | 1/17 | 1/19 | 1/21 | |
| Recursion | King Day | Dunder Methods [v] | King Day | HW0: Sortable [Code][Video] |
| 3 | 1/24 | 1/26 | 1/28 | |
| Lists | Sortable Review [-] | Cons [v] | Cons Remove [v] | |
| 4 | 1/31 | 2/2 | 2/4 | |
| Stacks/Queues | Cons Sort [v] | Cons for Data [v] | Cons to LinkList [v] | HW1: SortList [Code] |
| 5 | 2/7 | 2/9 | 2/11 | |
| Theory | SortList Review | Sorting Linked Lists [v] | C3ns [v] | |
| 6 | 2/14 | 2/16 | 2/18 | |
| BST | R3mov3 Part 0b0 [v] | R3mov3 Part 0b1 [v] | Advanced C3ns [v] | HW2: BST [Code] |
| 7 | 2/21 | 2/23 | 2/25 | |
| Midterm I | Mid-Semester Break | Midterm Review | Midterm I | Practice Midterm I |
| 8 | 2/28 | 3/2 | 3/4 | |
| Graphs | BST Review | Graph Theory [v] | Graph.py [v] | |
| 9 | 3/7 | 3/9 | 3/11 | |
| Graph Paths | Graph Paths [v] | Graph Paths (All) [v] | Graph Paths (Short) [v] | |
| 10 | 3/14 | 3/16 | 3/18 | |
| Efficiency | Djikstra [v] | Hashing [v] | Complexity [v] | HW3: Graph Ops [Code] |
| 11 | 3/21 | 3/23 | 3/25 | |
| OFF | OFF | OFF | OFF | |
| 12 | 3/28 | 3/30 | 4/1 | |
| Graph Ops | Connectivity [v] | Minimum Spanning Tree [v] | Graph Coloring [v] | |
| 13 | 4/4 | 4/6 | 4/8 | |
| Search/Sort | O(n^2) sort | O(n*log(n)) sort | Shortest Path Review | HW3: Graph Ops [Code] |
| 14 | 4/11 | 4/13 | 4/15 | |
| Midterm II | Midterm Review | Research Fair | Midterm II | Practice Midterm II |
| 15 | 4/18 | 4/20 | 4/22 | |
| Project | Seaborn | BSTs Again | Github.io | |
| 16 | 4/25 | 4/27 | 4/29 | |
| Enrichment | Data Set Ethics | Scientific Writing | Study Days | Final Project (Due 5/3) |