Search this site
Embedded Files
Skip to main content
Skip to navigation
CS 312 - Algorithms [F24]
Overview
Syllabus
Schedule
Section 01 (St. John)
Section 02 (Uwacu)
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 - Graphs (DFS)
Notes 9 - Graphs (BFS)
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 - Dynamic programming (pseudo-polynomial running time)
Notes 18 - Divide-and-conquer (recursion tree)
Notes 19 - Divide-and-conquer (unified method)
Notes 20 - Network flow (Steps 1 and 2)
Notes 21 - Network flow (Steps 3 and 4)
Notes 22 - Intractability (P and NP)
Notes 23 - Intractability (NP-completeness)
Peer articulation modules (Part 1)
Peer articulation modules (Part 2)
Course Materials
Topic modules
Articulation practice
Homeworks
Tools & Resources
Math Quick Reference
CS 312 - Algorithms [F24]
Overview
Syllabus
Schedule
Section 01 (St. John)
Section 02 (Uwacu)
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 - Graphs (DFS)
Notes 9 - Graphs (BFS)
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 - Dynamic programming (pseudo-polynomial running time)
Notes 18 - Divide-and-conquer (recursion tree)
Notes 19 - Divide-and-conquer (unified method)
Notes 20 - Network flow (Steps 1 and 2)
Notes 21 - Network flow (Steps 3 and 4)
Notes 22 - Intractability (P and NP)
Notes 23 - Intractability (NP-completeness)
Peer articulation modules (Part 1)
Peer articulation modules (Part 2)
Course Materials
Topic modules
Articulation practice
Homeworks
Tools & Resources
Math Quick Reference
More
Overview
Syllabus
Schedule
Section 01 (St. John)
Section 02 (Uwacu)
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 - Graphs (DFS)
Notes 9 - Graphs (BFS)
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 - Dynamic programming (pseudo-polynomial running time)
Notes 18 - Divide-and-conquer (recursion tree)
Notes 19 - Divide-and-conquer (unified method)
Notes 20 - Network flow (Steps 1 and 2)
Notes 21 - Network flow (Steps 3 and 4)
Notes 22 - Intractability (P and NP)
Notes 23 - Intractability (NP-completeness)
Peer articulation modules (Part 1)
Peer articulation modules (Part 2)
Course Materials
Topic modules
Articulation practice
Homeworks
Tools & Resources
Math Quick Reference
Peer instruction modules
Decembe
r 10
Report abuse
Report abuse
