everything.study
CS 341

Algorithms

Undergraduate

Fall 2026

Topics

  • Recurrences and divide-and-conquer
  • Breadth-first and depth-first search
  • Directed graphs
  • Greedy algorithms
  • Shortest paths and minimum spanning trees
  • Dynamic programming
  • Maximum flow and minimum cuts
  • Polynomial reductions
  • NP-completeness

Readings

  • Algorithms
    Dasgupta; Papadimitriou; Vazirani · reference
  • Algorithms
    Jeff Erickson · reference
  • Introduction to Algorithms
    Cormen; Leiserson; Rivest; Stein · reference
  • The Algorithm Design Manual
    Steven Skiena · reference
  • Algorithm Design
    Kleinberg; Tardos · reference
  • Computers and Intractability: A Guide to the Theory of NP-Completeness
    Garey; Johnson · further reference
  • Computational Intractability
    Demaine; Gasarch; Hajiaghayi · further reference
Undated

Topics

  • Introduction and Analysis of Algorithms
  • Algorithm Design Techniques
  • Undecidability and Intractability

Readings

  • Introduction to Algorithms, 3rd ed.,
    T. Cormen, C. Leiserson, R. Rivest, and C. Stein · 3rd ed. · typical reference
Sources