Introduction to Algorithms

CSE 421 | Winter 2026

Lecture and section material†

 

• Lecture 1: Thinking like a computer scientist (pdf)
• Lecture 2: Writing algorithms and graph traversal (pdf, KT: 3-3.6, DPV: 4.2-4.3)
• Lecture 3: Graph traversal, DFS, BFS, applications (pdf)
• Lecture 4: Directed graphs and greedy algorithms (pdf, KT: 4-4.2, DPV: 5-5.1)
• Lecture 5: Greedy approximation and graph algorithms (pdf), KT: 12.4,4.4-4.7, DPV: 4.4-4.7)
• Lecture 6: More greedy algorithms (pdf)
• Lecture 7: Minimum spanning trees (pdf, KT: 5-5.4, DPV: 2.2-2.4)

• Section 1 (pdf)
• Section 2 (pdf)
• Section 3 (pdf)

^{†. Course schedule and contents subject to change and will be announced throughout the term.↩}