Computer Science 252 - Algorithms
Algorithms
Fall
2025
01
4.00
Alicia M Grubb
W F 1:20 PM - 2:35 PM; M 1:40 PM - 2:55 PM
Smith College
CSC-252-01-202601
Ford 240
amgrubb@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