LE/EECS 3101
Design and Analysis of Algorithms
Fall 2026
Topics
- Proofs of correctness
- asymptotic analysis
- recursive algorithms
- divide and conquer
- selection and sorting
- dynamic programming
- greedy algorithms
- shortest paths
- spanning trees
- graph algorithms
Readings
- Listed text: Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, 4th ed. (2022).
- Optional: Dasgupta, Papadimitriou and Vazirani, Algorithms; Parberry, Problems on Algorithms.
- Other references include Edmonds, How to Think About Algorithms, 2nd ed.; Garey and Johnson, Computers and Intractability; Graham, Knuth and Patashnik, Concrete Mathematics, 2nd ed.; Kleinberg and Tardos, Algorithm Design; Knuth, The Art of Computer Programming, volumes 1 and 3; Levitin, Introduction to the Design and Analysis of Algorithms, 3rd ed.; Skiena, The Algorithm Design Manual, 2nd ed.; Skiena and Revilla, Programming Challenges.
Sources
- Course catalogue ↗2026–2027
- Public course website / syllabus ↗Fall 2026