COS 364 - Algorithm Design and Analysis

Examines algorithm design techniques such as divide-and-conquer, dynamic programming, the greedy approach, backtracking, and branch-and-bound. Representative algorithms are studied in each category, with an emphasis on demonstrating an algorithm’s correctness and analyzing its efficiency in terms of computing time and storage space requirements. The notion of intractable problems is introduced, along with efficient approaches to these problems, such as approximation algorithms. Course Typically Offered: Even fall.

Prerequisite(s): COS 142 and MAT 151M (MAT 151M can be taken concurrently with COS 364).

Credits: 4