Fall 2019 Course Descriptions

COMP 160-02 Algorithms

M. Korman
TR 6:00p-7:15p, Barnum/Dana Hall 104
M+ 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.


Back to Main Courses Page