Algorithms for Data Science
1:10pm–2:25pm
Seeley W. Mudd Building 833
Morningside
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
Description
Corequisites: COMS W4121 Methods for organizing data, e.g. hashing, trees, queues, lists,priority queues. Streaming algorithms for computing statistics on the data. Sorting and searching. Basic graph models and algorithms for searching, shortest paths, and matching. Dynamic programming. Linear and convex programming. Floating point arithmetic, stability of numerical algorithms, Eigenvalues, singular values, PCA, gradient descent, stochastic gradient descent, and block coordinate descent. Conjugate gradient, Newton and quasi-Newton methods. Large scale applications from signal processing, collaborative filtering, recommendations systems, etc.
Reviews
Course experience
Aggregated across everyone who has taught this course.
No reviews matched yet.
Instructor quality
n=13, 2015–2026
Aggregated across every course Eleni Drinea has taught.
Teaching quality
4.1 / 5
Grading fairness
No signal
Workload
No signal
Difficulty
3.2 / 5 · Moderate
Overall sentiment
Positive
In your week
Where it meets
Flat map — motion reduced