Schedule

• Wed 9/4 - Notes 1 - Getting Started

  • Getting Started Form (Due 9/6)

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

  • EdStem Module: Stable matching(Due 9/13)

• Mon 9/9 - [Notes 2 - Stable matching (Steps 1 and 2)

• Wed 9/11 - [Notes 3 - Stable matching (Steps 3 and 4)

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

  • EdStem Module: Asymptotic analysis (Due 9/20)

• Mon 9/16 - [Notes 4 - Asymptotics (intro, big-O)

• Wed 9/18 - [Notes 5 - Asymptotics (big-Ω, big-Θ)

  • Homework 2: Asymptotics] (Due 9/26)

• Mon 9/23 - [Notes 6 - Algorithmic analysis (proof workshop)

• Wed 9/25 - [Notes 7 - Algorithmic analysis (problem workshop)

  • EdStem Module: Graphs (traversals)  (Due 10/4)

  • Quiz 1: Set Cover, Stable Matching, Asymptotics (Due 10/4)

• Mon 9/30 - [Notes 8 - Graphs (DFS)

• Wed 10/2 - [Notes 9 - Graphs (BFS)

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

  • EdStem Module: Graphs (bipartite & directed) (Due 10/11)

• Mon 10/7 - [Notes 10 - Graphs (bipartite)

• Wed 10/9 - [Notes 11 - Graphs (directed)

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

  • EdStem Module: Greedy algorithms (Due 10/30)

• Mon 10/14 - NO CLASS - Fall break

• Tue 10/15 - NO CLASS - Fall break

• Wed 10/16 - [Notes 12 - Greedy algorithms (single-source shortest paths)

• Mon 10/21 - [Notes 13 - Greedy algorithms (MST)

• Wed 10/23 - [Notes 14 - Greedy algorithms (interval problems)

  • Homework 5: Greedy algorithms (Due 11/7)

  • Quiz 2: graphs (Due 11/1)

• Mon 10/28 - [Notes 15 - Dynamic programming (foundations)

• Wed 10/30 - [Notes 16 - Dynamic programming (knapsack)

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

  • EdStem Module: Divide-and-conquer (Due 11/15)

• Mon 11/4 - [Notes 17 - Dynamic programming (pseudo-polynomial running time)

  • Optional: peer instruction module proposal (Due 11/12)

Wed 11/6 - overflow

• * Mon 11/11 - [Notes 18 - Divide-and-conquer (recursion tree)

• Wed 11/13 - [Notes 19 - Divide-and-conquer (unified method)

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

  • EdStem Module: Network flow (Due 11/22)

  • Quiz 3: greedy & DP (Due 11/22)

• Mon 11/18 - [Notes 20 - Network flow (Steps 1 and 2)

• Wed 11/20 - [Notes 21 - Network flow (Steps 3 and 4)

  • Homework 8: Network flow (Due 12/3)

  • EdStem Module: Intractability (Due 12/6)

• Mon 11/25 - [Notes 22 - Intractability (P and NP)

• Wed 11/27 - NO CLASS - November break

• Thu 11/28 - NO CLASS - November break

• Fri 11/29 - NO CLASS - November break

• Mon 12/2 - [Notes 23 - Intractability (NP-completeness)

  • Homework 9: Intractability (Due 12/10)

• Wed 12/4 - Peer modules

• Mon 12/9 - Peer modules