Print and PDF Options

COMP 3804 [0.5 credit] Design and Analysis of Algorithms I

An introduction to the design and analysis of algorithms. Topics include: divide-and-conquer, dynamic programming, linear programming, greedy algorithms, graph algorithms, NP-completeness.
Also listed as MATH 3804.
Prerequisite(s): one of COMP 2402 or SYSC 2100, and either COMP 2804 or both of MATH 2007 and MATH 2108 or equivalents.
Lectures three hours a week.