Spring 2020 Course Descriptions
COMP 160-01 Algorithms
K. Edwards, M. Korman
MW 3:00-4:15, Barnum/Dana Hall 008
I+ Block
Introduction to the study of algorithms. Strategies such as divide-and-conquer, greedy methods, and dynamic programming. Graph algorithms, sorting, searching, integer arithmetic, hashing, and NP-complete problems.
Prerequisite: COMP 15 and COMP/MATH 22 or 61.