Search this site
Embedded Files
Skip to main content
Skip to navigation
CS 312 - Algorithms [F25]
Overview
Syllabus
At a Glance
Schedule
Audrey section
Diane section
Notes
Notes 1 - Getting Started
Notes 2 - Stable matching (Steps 1 and 2)
Notes 3 - Stable matching (Steps 3 and 4)
Notes 4 - Asymptotics (intro, big-O)
Notes 5 - Asymptotics (big-Ω, big-Θ)
Notes 6 - Algorithmic analysis (asymptotics workshop)
Notes 7 - Algorithmic analysis (proof workshop)
Notes 8 - Problem Workshop
Notes 9 - Graphs (BFS/DFS)
Notes 10 - Graphs (bipartite)
Notes 11 - Graphs (directed)
Notes 12 - Greedy algorithms (single-source shortest paths)
Notes 13 - Greedy algorithms (MST)
Notes 14 - Greedy algorithms (interval problems)
Notes 15 - Dynamic programming (foundations)
Notes 16 - Dynamic programming (knapsack)
Notes 17 - Divide-and-conquer (recursion tree)
Notes 18 - Divide-and-conquer (unified method)
Notes 19 - Network flow (Steps 1 and 2)
Notes 20 - Network flow (Steps 3 and 4)
Notes 21 - Intractability (P and NP)
Notes 22 - Intractability (NP-completeness)
Group modules
Diane's section: Group modules
Audrey's section: Group modules
Course Materials
Topic modules
Articulation practice
Homeworks
Tools & Resources
Math Quick Reference
CS 312 - Algorithms [F25]
Overview
Syllabus
At a Glance
Schedule
Audrey section
Diane section
Notes
Notes 1 - Getting Started
Notes 2 - Stable matching (Steps 1 and 2)
Notes 3 - Stable matching (Steps 3 and 4)
Notes 4 - Asymptotics (intro, big-O)
Notes 5 - Asymptotics (big-Ω, big-Θ)
Notes 6 - Algorithmic analysis (asymptotics workshop)
Notes 7 - Algorithmic analysis (proof workshop)
Notes 8 - Problem Workshop
Notes 9 - Graphs (BFS/DFS)
Notes 10 - Graphs (bipartite)
Notes 11 - Graphs (directed)
Notes 12 - Greedy algorithms (single-source shortest paths)
Notes 13 - Greedy algorithms (MST)
Notes 14 - Greedy algorithms (interval problems)
Notes 15 - Dynamic programming (foundations)
Notes 16 - Dynamic programming (knapsack)
Notes 17 - Divide-and-conquer (recursion tree)
Notes 18 - Divide-and-conquer (unified method)
Notes 19 - Network flow (Steps 1 and 2)
Notes 20 - Network flow (Steps 3 and 4)
Notes 21 - Intractability (P and NP)
Notes 22 - Intractability (NP-completeness)
Group modules
Diane's section: Group modules
Audrey's section: Group modules
Course Materials
Topic modules
Articulation practice
Homeworks
Tools & Resources
Math Quick Reference
More
Overview
Syllabus
At a Glance
Schedule
Audrey section
Diane section
Notes
Notes 1 - Getting Started
Notes 2 - Stable matching (Steps 1 and 2)
Notes 3 - Stable matching (Steps 3 and 4)
Notes 4 - Asymptotics (intro, big-O)
Notes 5 - Asymptotics (big-Ω, big-Θ)
Notes 6 - Algorithmic analysis (asymptotics workshop)
Notes 7 - Algorithmic analysis (proof workshop)
Notes 8 - Problem Workshop
Notes 9 - Graphs (BFS/DFS)
Notes 10 - Graphs (bipartite)
Notes 11 - Graphs (directed)
Notes 12 - Greedy algorithms (single-source shortest paths)
Notes 13 - Greedy algorithms (MST)
Notes 14 - Greedy algorithms (interval problems)
Notes 15 - Dynamic programming (foundations)
Notes 16 - Dynamic programming (knapsack)
Notes 17 - Divide-and-conquer (recursion tree)
Notes 18 - Divide-and-conquer (unified method)
Notes 19 - Network flow (Steps 1 and 2)
Notes 20 - Network flow (Steps 3 and 4)
Notes 21 - Intractability (P and NP)
Notes 22 - Intractability (NP-completeness)
Group modules
Diane's section: Group modules
Audrey's section: Group modules
Course Materials
Topic modules
Articulation practice
Homeworks
Tools & Resources
Math Quick Reference
Diane's section: Group modules
Graph Traversals - Social Network Matching
Group Module - Greedy algorithms
Group Module: GRAPHS
Why Weighted Interval Scheduling Cannot Be Solved by Greedy — And How Dynamic Programming Saves the Day
Group Module Reflection.pptx
Report abuse
Report abuse
Group Module Reflection.pptxGroup Module Reflection.pptx