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 CSPB 3104.
instructor(s)
Chen, Lijun
Primary Instructor
- Fall 2018 / Spring 2020 / Spring 2022 / Fall 2024