| Week 1 | |||||
|---|---|---|---|---|---|
| # | Day | Date | Topic | Reading | Work Due |
| 1 | Th | 8/26 | Introduction to the course | ||
| Week 2 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 2 | T | 8/31 | Growth Mindset, Fundamentals of Analysis | The Secret to Raising Smart Kids, by Carol S. Dweck; CLRS 2.1-2.3 | |
| 3 | Th | 9/2 | Asymptotic Notation | CLRS 3.1-3.2 | |
| Week 3 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 4 | T | 9/7 | Divide and Conquer | Problem Set 1 | |
| 5 | Th | 9/9 | The Substitution Method | CLRS 4.3 – 4.4 | |
| Week 4 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 6 | T | 9/14 | Theorem 4.1 | CLRS 4.5 | Quiz over LO 1 – 4 |
| 7 | Th | 9/16 | Comparison Based Sorts | CLRS 8.1 | |
| Week 5 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 8 | T | 9/21 | Sorting in Linear Time | CLRS 8.2 – 8.4 | Problem Set 2 |
| 9 | Th | 9/23 | Balanced Trees | CLRS 13.1 – 13.4 | |
| Week 6 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 10 | T | 9/28 | Balanced Trees | Quiz over 5 – 8 plus redos | |
| Th | 9/30 | No Class | |||
| Week 7 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 11 | T | 10/5 | Race and Ethnicity | Race after Technology, by Ruha Benjamin | |
| 12 | Th | 10/7 | Ethical Concerns | ||
| Week 8 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 13 | T | 10/12 | Dynamic Programming | CLRS 15.1, 15.3 – 15.5 | Problem Set 3 |
| 14 | Th | 10/14 | Dynamic Programming | Essay | |
| Fall Break | |||||
| 10/16 – 10/24 | |||||
| Week 9 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 15 | T | 10/26 | Greedy Algorithms | CLRS 16.1 – 16.3 | |
| 16 | Th | 10/28 | Greedy Algorithms | ||
| Week 10 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 17 | T | 11/2 | Disjoint Sets | CLRS 21.1 – 21.3 | Problem Set 4 |
| 18 | Th | 11/4 | Disjoint Sets | ||
| Week 11 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 19 | T | 11/9 | Topological Sort | CLRS 22.4 | Problem Set 5 |
| 20 | Th | 11/11 | Network Flow | CLRS 26.1 – 26.3 | |
| Week 12 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 21 | T | 11/16 | Tries | Quiz on LO 9-10 plus redos | |
| 22 | Th | 11/18 | Reading a CS Research Paper & String Matching | ||
| Week 13 | |||||
| # | Day | Date | Topic | Reading | Work Due |
| 23 | T | 11/23 | Class Cancelled | Problem Set 6 | |
| Th | 11/25 | Thanksgiving Break | |||
| Week 14 | |||||
| Day | Date | Work Due | |||
| 24 | T | 11/30 | Discussion of the research paper | Sliding Suffix Trees | Quiz over LO 11 plus redos |
| 25 | Th | 12/2 | Implementation of the Research paper | ||
| Week 15 | |||||
| Day | Date | Work Due | |||
| 26 | T | 12/7 | Mock Interviews | Problem Set 7 | |
| 27 | Th | 12/9 | Course Wrap-up | ||
| Finals Week | |||||
| Day | Date | Work Due | |||
| F | 12/17 | Quiz 1 – 11 (optional) |
