Close Menu
View Course Sections

Course Description

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.  Prerequisites:  COMP 15 and MATH/COMP 61  or graduate standing

Affiliated With:

  • School of Engineering