Andrea Coladangelo's Homepage

CSE 421: "Introduction to Algorithms" (Autumn 2025)

Home Syllabus Calendar Lecture & Section Material Assignments Exams Course Staff

*The lecture and section material below is based heavily on previous CSE 421 iterations by Robbie Weber and Chinmay Nirkhe.
*Slides were created in keynote (and are best viewed in that format). The converted ppt file has occasional formatting issues.

Lectures

09/24: Logistics; stable matchings (slides: keynote, ppt, pdf)

09/26: More stable matchings (slides: keynote, ppt, pdf)

09/29: Graph traversal; Breadth-First Search (slides: keynote, ppt, pdf)

10/01: BFS, DFS, and applications (bipartiteness testing) (slides: keynote, ppt, pdf)

10/03: DFS and applications (cycle detection, topological sorting) (slides: keynote, ppt, pdf)

10/06: Graph modeling; Greedy algorithms (intro and interval scheduling) (slides: keynote, ppt, pdf)

10/08: Greedy graph algorithms (minimum spanning trees) (slides: keynote, ppt, pdf)

10/10: Greedy graph approximation algorithms (max cut) (slides: keynote, ppt, pdf)

10/13: Divide and Conquer (mergesort, 2D closest pair)(slides: keynote, ppt, pdf)

10/15: Divide and Conquer (runtimes, Strassen's matrix multiplication) (slides: keynote, ppt, pdf)

10/17: Divide and Conquer (Karatsuba's integer multiplication, median finding) (slides: keynote, ppt, pdf)

10/20: Divide and Conquer (median/selection finding) (slides: keynote, ppt, pdf)

10/22: Dynamic Programming (memoization, edit distance) (slides: keynote, ppt, pdf)

10/24: Dynamic Programming (edit distance, knapsack) (slides: keynote, ppt, pdf)

10/27: Dynamic Programming (Bellman-Ford) (slides: keynote, ppt, pdf)

10/29: Dynamic Programming (Bellman-Ford continued) (slides: keynote, ppt, pdf)

11/05: Max Flow and Min Cut (intro) (slides: keynote, pdf)

11/07: Max Flow and Min Cut (Ford-Fulkerson) (slides: keynote, ppt, pdf)

11/10: Max Flow and Min Cut (Ford-Fulkerson continued, and Max Flow-Min Cut theorem) (slides: keynote, ppt, pdf)

11/12: Max Flow and Min Cut (Faster algorithms, and applications) (slides: keynote, ppt, pdf)

11/14: Wrapping up Max Flow & Intro to P, NP, and reductions (slides: keynote, ppt, pdf)

11/17: NP-completeness (slides: keynote, ppt, pdf)

11/19: More NP-completeness (slides: keynote, ppt, pdf)

11/21: More NP-completeness (3-SAT) (slides: keynote, ppt, pdf)

11/24: More NP-completeness (Vertex Cover and 3-coloring) (slides: keynote, ppt, pdf)

11/27: Linear Programming (slides: keynote, ppt, pdf)

12/01: Linear Programming (optimal solutions, and simplex method) (slides: keynote, ppt, pdf)

12/03: Linear Programming (simplex method continued, LP approximation of vertex cover) (slides: keynote, ppt, pdf)