Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy algorithms, dynamic programming, linear programming, graph algorithms, problems in P and NP, and approximation algorithms. Same as CSCI 3104.
instructor(s)
Reckwerdt, Eric Asher
Primary Instructor
- Summer 2019 / Fall 2019 / Spring 2020 / Summer 2020 / Fall 2020 / Spring 2021 / Summer 2021 / Fall 2021 / Spring 2022 / Summer 2022 / Fall 2022 / Spring 2023 / Summer 2023 / Fall 2023
