Spring 2020 Course Descriptions

COMP 160-02 Algorithms

K. Edwards, M. Korman
MW 4:30-5:45p, Robinson Hall 253
K+ 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