Loading...

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
Loading...

Thank you for your interest in this course.  Unfortunately, the course you have selected is currently not open for enrollment.  Please use the button below to be added to our mailing list and we will notify you when enrollment opens.  

Required fields are indicated by .