Schedule

Thu 9/7 - Getting Started

• Getting to Know You Survey & Learning Self-Inventory (Due 9/8)

• Stable Matching Module 1 (complete before 9/12 class)

Tue 9/12 - SRL & Stable Matching

• Stable Matching Module 2 (complete before 9/14 class)

Thu 9/14 - Stable Matching & Proof Workshop

• HW 1: Stable matching (Due 9/21)

• Asymptotics Module (complete before 9/19 class)

Tue 9/19 - Asymptotics

• Graphs (traversals & bipartite) Module 1 (complete before 9/21 class)

Thu 9/21 - Asymptotics (continued)

• HW 2: Asymptotics (Due 9/28)

• Graphs (traversals & bipartite) Module 2 (complete before 9/26 class)

Tue 9/26 - Graph Traversals; Stable Matching Synthesis

• Graphs (traversals & bipartite) Module 3 (complete before 9/28 class)

• Quiz 1: Stable Matching (Due 9/29)

Thu 9/28 - Bipartite Graphs

• HW 3: Graphs (traversals & bipartite) (Due 10/5)

• Graphs (directed) Module 1 (complete before 10/3 class)

Tue 10/3 - Directed Graphs; Asymptotics Synthesis

• Quiz 2: Asymptotics (Due 10/6)

• Graphs (directed) Module 2 (complete before 10/5 class)

Thu 10/5 - Directed Graphs (topological sorting and DAGs)

• HW 4: Graphs (directed) (Due 10/19)

• Greedy Module 1 (complete before 10/12 class)

Mon 10/9 - FALL BREAK

Tue 10/10 - FALL BREAK

Thu 10/12 - Greedy Algorthms (stay ahead, as in shortest paths)

• Greedy Module 2 (complete before 10/17 class)

Tue 10/17 - Greedy Algorithms (exchange as in MST); Graphs (traversals & bipartite) Synthesis

• Quiz 3: Graphs (traversals & bipartite) (Due 10/20)

• Greedy Module 3 (complete before 10/19 class)

Thu 10/19 - Greedy (intervals)

• HW 5: Greedy algorithms (Due 10/26)

• Dynamic programming - module 1 (complete before 10/24 class)

Tue 10/24 - Dynamic Programming (foundations); Graphs (directed) Synthesis

• Quiz 4: Graphs (directed) (Due 10/27 10/31)

• Dynamic Programming Module 2 (complete as much as you can before 10/26 class)

Thu 10/26 - Dynamic Programming (optimization)

• HW 6: Dynamic Programming (Due 11/8)

• Divide-and-conquer Module 1 (complete as much as you can before 10/31 class)

Tue 10/31 - Greedy Synthesis; Dynamic programming (overflow)

• Quiz 5: Greedy (Due 11/7; submit by 11/3 EOD and your quiz grade will be min{5 + earned points, 100})

Thu 11/2 - Divide-and-conquer (recursion tree/unrolling)

• HW 7: Divide-and-conquer (Due 11/15)

• Network flow - module 1 (complete as much as you can before 11/9 class)

Tue 11/7 - Divide-and-conquer (unified method)

• Quiz 6: Dynamic Programming (Due 11/14; submit by 11/10 EOD and your quiz grade will be min{5 + earned points, 100})

Thu 11/9 - Network Flow; Dynamic Programming Synthesis

• Network flow - module 2 (complete as much as you can before 11/14 class)

• HW 8: Network flow (Due 11/20)

Tue 11/14 - Network Flow cont'd

• Intractability - module 1 (complete as much as you can before 11/16 class)

• Quiz 7: Divide-and-conquer (Due 11/21; submit by 11/17 EOD and your quiz grade will be min{5 + earned points, 100}))

Thu 11/16 - Intractability; Divide-and-conquer Synthesis

• Intractability - module 2 (complete as much as you can before 11/21 class)

• HW 9: Intractability (Due 11/30)

Tue 11/21 - Intractability cont'd

Wed 11/22 - NOV BREAK

Thu 11/23 - NOV BREAK

Fri 11/24 - NOV BREAK

Tue 11/28 - Network Flow Synthesis & Peer articulation modules

• Quiz 8: Network Flow (Due 12/1)

Thu 11/30 - Peer articulation modules

Tue 12/5 - Intractability Synthesis & Peer articulation modules

• Quiz 9: Intractability (Due 12/8)

Thu 12/7 - Peer articulation modules

Tue 12/12 - Peer articulation modules

Stable Matching: Tuesday, September 26 - Team 2

Asymptotics: Tuesday, October 3 - Team 7

Graphs (traversals & bipartite): Tuesday, October 17 - Team 8

Graphs (directed): Tuesday, October 24 - Team 5

Greedy: Tuesday, October 31 - Team 1

Dynamic Programming: Tuesday, November 7 - Team 3

Divide-and-conquer: Tuesday, November 14 - Team 6

Network Flow: Tuesday, November 28 - Team 9

Intractability: Tuesday, December 5 - Team 4