Back to Resources

An algorithms course grounding classical design methods, including greedy strategies, divide and conquer, and dynamic programming, in data science applications. Students then study methods suited to large or streaming datasets, where repeated scans are infeasible, practicing with approximation and randomized algorithms designed for efficiency at scale.
- Level
- Intermediate
- Department
- CDS
- Credits
- 4
- Prerequisites
- DS 121 & DS 210
Instructors
Last verified: August 22, 2026
Suggest a correction