This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems.
instructor(s)
Sankaranarayanan, Sriram
Primary Instructor
- Summer 2021 / Fall 2021 / Spring 2022 / Summer 2022 / Fall 2022 / Spring 2023 / Summer 2023 / Fall 2023 / Spring 2024
