Computer Science 252 - Algorithms
Algorithms
Fall
2026
01
4.00
Ileana Streinu
TU TH 9:25 AM - 10:40 AM
Smith College
CSC-252-01-202701
Ford 241
istreinu@smith.edu
Covers algorithm design techniques ("divide-and-conquer," dynamic programming, "greedy" algorithms, etc.), analysis techniques (including big-O notation, recurrence relations), useful data structures (including heaps, search trees, adjacency lists), efficient algorithms for a variety of problems and NP-completeness. Designation: Theory. Prerequisites: CSC 210, MTH 111 and MTH 153. Enrollment limited to 30.
[CE] CSC 210, MTH 111 & MTH 153