Search this site
Embedded Files
Skip to main content
Skip to navigation
CS 312 - Algorithms
Overview
Syllabus
Schedule
Notes
9/7 - Getting Started
9/12 - Stable Matching (steps 1 and 2)
9/14 - Stable Matching & Proof workshop
9/19 - Asymptotics
9/21 - Asymptotics (continued)
9/26 - Graphs (traversals)
9/28 - Graphs (bipartite)
10/3 - Graphs (directed)
10/5 - Graphs (directed)
10/12 - Greedy algorithms (shortest paths)
10/17 - Greedy algorithms (MST)
10/19 - Greedy algorithms (interval problems)
10/24 - Dynamic Programming (foundations)
10/26 - Dynamic Programming (knapsack)
10/31 - DP (overflow) & Divide-and-conquer (recursion tree/unrolling)
11/2 - Divide-and-conquer (recursion tree/unrolling)
11/7 - Divide-and-conquer (master method)
11/9 - Network Flow
11/14 - Network Flow cont'd
11/16 - Intractability
11/21 - Intractability
11/28
11/30
12/5
Coursework
Articulation practice
Topic modules
Homeworks
Tools & Resources
Math Quick Reference
CS 312 - Algorithms
Overview
Syllabus
Schedule
Notes
9/7 - Getting Started
9/12 - Stable Matching (steps 1 and 2)
9/14 - Stable Matching & Proof workshop
9/19 - Asymptotics
9/21 - Asymptotics (continued)
9/26 - Graphs (traversals)
9/28 - Graphs (bipartite)
10/3 - Graphs (directed)
10/5 - Graphs (directed)
10/12 - Greedy algorithms (shortest paths)
10/17 - Greedy algorithms (MST)
10/19 - Greedy algorithms (interval problems)
10/24 - Dynamic Programming (foundations)
10/26 - Dynamic Programming (knapsack)
10/31 - DP (overflow) & Divide-and-conquer (recursion tree/unrolling)
11/2 - Divide-and-conquer (recursion tree/unrolling)
11/7 - Divide-and-conquer (master method)
11/9 - Network Flow
11/14 - Network Flow cont'd
11/16 - Intractability
11/21 - Intractability
11/28
11/30
12/5
Coursework
Articulation practice
Topic modules
Homeworks
Tools & Resources
Math Quick Reference
More
Overview
Syllabus
Schedule
Notes
9/7 - Getting Started
9/12 - Stable Matching (steps 1 and 2)
9/14 - Stable Matching & Proof workshop
9/19 - Asymptotics
9/21 - Asymptotics (continued)
9/26 - Graphs (traversals)
9/28 - Graphs (bipartite)
10/3 - Graphs (directed)
10/5 - Graphs (directed)
10/12 - Greedy algorithms (shortest paths)
10/17 - Greedy algorithms (MST)
10/19 - Greedy algorithms (interval problems)
10/24 - Dynamic Programming (foundations)
10/26 - Dynamic Programming (knapsack)
10/31 - DP (overflow) & Divide-and-conquer (recursion tree/unrolling)
11/2 - Divide-and-conquer (recursion tree/unrolling)
11/7 - Divide-and-conquer (master method)
11/9 - Network Flow
11/14 - Network Flow cont'd
11/16 - Intractability
11/21 - Intractability
11/28
11/30
12/5
Coursework
Articulation practice
Topic modules
Homeworks
Tools & Resources
Math Quick Reference
Coursework
Topic modules and associated slide decks
Articulation practice
Â
Report abuse
Report abuse
