Schedule

Thu 9/4 - Notes 1 - Getting Started

• Kickoff survey (Due 9/5)

• Homework 0: Algorithm Design (Set Cover) (Due 9/10)

Tue 9/9 - Notes 2 - Stable matching (Steps 1 and 2)

Thu 9/11 - Notes 3 - Stable matching (Steps 3 and 4)

• Homework 1: Stable Matching (Due 9/17)

Tue 9/16 - Notes 4 - Asymptotics (intro, big-O)

Thu 9/18 - Notes 5 - Asymptotics (big-Ω, big-Θ)

• Homework 2: Asymptotics (Due 9/24)

Tue 9/23 - Notes 6 - Algorithmic analysis (asymptotics workshop)

Thu 9/25 - Notes 7 - Algorithmic analysis (proof workshop)

Tue 9/30 - Notes 8 - Problem Workshop

• Quiz 1 (Due 10/6)

Thu 10/2 - Notes 9 - Graphs (BFS/DFS)

• Homework 3: Graphs (traversals) (Due 10/8)

Tue 10/7 - Notes 10 - Graphs (bipartite)

Thu 10/9 - Notes 11 - Graphs (directed)

• Homework 4: Graphs (bipartite & directed) (Due 10/20)

Mon 10/13 - NO CLASS (Fall break)

Tue 10/14 - NO CLASS (Fall break)

Thu 10/16 - Notes 12 - Greedy algorithms (single-source shortest paths)

Tue 10/21 - Notes 13 - Greedy algorithms (MST)

• Homework 5: Greedy algorithms (Due 10/29)

• Quiz 2 (Due 10/27)

Thu 10/23 - Notes 14 - Greedy algorithms (interval problems)

Tue 10/28 - Notes 15 - Dynamic programming (foundations)

Thu 10/30 - Notes 16 - Dynamic programming (knapsack)

• Homework 6: Dynamic Programming (Due 11/5)

Tue 11/4 - Notes 17 - Divide-and-conquer (recursion tree)

Thu 11/6 - Notes 18 - Divide-and-conquer (unified method)

• Homework 7: Divide-and-conquer (Due 11/12)

Tue 11/11 - Notes 19 - Network flow (Steps 1 and 2)

• Quiz 3 (Due 11/17)

Thu 11/13 - Notes 20 - Network flow (Steps 3 and 4)

• Homework 8: Network flow (Due 11/24)

Tue 11/18 - Notes 21 - Intractability (P and NP)

Thu 11/20 - Notes 22 - Intractability (NP-completeness)

• Homework 9: Intractability (Due 12/1)

Tue 11/25 - Group module prep

Wed 11/26 - NO CLASS (November break)

Thu 11/27 - NO CLASS (November break)

Fri 11/28 - NO CLASS (November break)

Tue 12/2 - Group module work time

Thu 12/4 - Group modules

Tue 12/9 - Group modules