Schedule

Tue 1/23 - Notes 1 - Getting started

• Getting Started Survey (Due 1/25)

• Stable matching module (2 lessons) (Due 2/1)

Thu 1/25 - Notes 2 - Stable matching (Steps 1 and 2)

Tue 1/30 - Notes 3 - Stable matching (Steps 3 and 4)

Tue 1/30 - Proof workshop

• Homework 1: Stable Matching (Due 2/6)

• Asymptotics module (Due 2/8)

Thu 2/1 - Proof workshop

Thu 2/1 - Notes 4 - Asymptotics (definitions)

Tue 2/6 - Notes 5 - Asymptotics (practice)

• Homework 2: Asymptotics (Due 2/13)

• Graphs (traversals & bipartite) module (Due 2/22)

Thu 2/8 - Notes 6 - Graphs (fundamentals)

Tue 2/13 - Notes 7 - Problem workshop (graphs)

Thu 2/15 - Notes 8 - Graphs (DFS)

• Quiz 1 on Topics 1&2 (Due 2/20)

Tue 2/20 - Notes 9 - Graphs (BFS)

• Homework 3: Graphs (traversals & bipartite) (Due 2/27)

Thu 2/22 - Notes 10 - Graphs (bipartite)

• Graphs (directed) module (Due 2/29)

Tue 2/27 - Notes 11 - Directed graphs

• Homework 4: Graphs (directed) (Due 3/5)

• Greedy module (Due 3/14)

Thu 2/29 - Notes 12 - Greedy algorithms (single-source shortest paths)

Tue 3/5 - Notes 13 - Greedy algorithms (MST, exchange)

• Homework 5: Greedy algorithms (Due 3/26)

• Dynamic programming module (Due 3/28)

Thu 3/7 - Notes 14 - Greedy algorithms (intervals)

• Quiz 2 on Topics 3&4 (Due 3/14)

Tue 3/12 - Notes 15 - Dynamic programming (foundations)

Thu 3/14 - Notes 16 - Dynamic programming (knapsack)

Tue 3/19 - NO CLASS - Spring Break

Thu 3/21 - NO CLASS - Spring Break

Tue 3/26 - Notes 17 - Dynamic programming (pseudo-polynomial run time)

• Homework 6: Dynamic Programming (Due 4/2)

• Divide-and-conquer module (Due 4/11)

Thu 3/28 - Notes 18 - divide-and-conquer (recursion tree)

Tue 4/2 - Notes 18 - Divide-and-conquer (unified method)

• Homework 7: Divide-and-conquer (Due 4/16)

Thu 4/4 - Notes 19 - Problem workshop (strings)

• Quiz 3 on Topics 5&6 (Due 4/11)

Tue 4/9 - NO CLASS - Community Day

• Network flow module (Due 4/18)

Thu 4/11 - Notes 21 - Network flow (Steps 1 and 2)

Tue 4/16 - Notes 22 - Network flow (Steps 3 and 4)

• Homework 8: Network flow (Due 4/23)

• Intractability module (Due 4/25)

Thu 4/18 - Notes 23 - Intractability (P and NP)

Tue 4/23 - Notes 24 - Intractability (NP-completeness)

• Homework 9: Intractability (Due 4/30)

Thu 4/25 - Peer articulation modules:

• Melanie Campanini: Applications of the Art Gallery Problem

• Hamnah Aleem, Ines Belkhodja & Hema Motiani: Tech Interview - Interval Scheduling

• Kaari Harsila: Greedy - Knapsack

Tue 4/30 - Peer articulation modules

• Janna Parrot: Machine Learning and Algorithms

• Angela Song & Kapper Wang: Dynamic Programming

• Priya Joshi & Miriam Xu: Kahoot review