An introduction to the design and analysis of algorithms. Topics include: recurrence relations, sorting and searching, divide-and-conquer, dynamic programming, greedy algorithms, NP-completeness. Also listed as COMP 3804. Prerequisite(s): COMP 2002 or COMP 2402, and either COMP 1805 or both of MATH 2007 and MATH 2108 or equivalents.Lectures three hours a week.

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

An introduction to the design and analysis of algorithms. Topics include: recurrence relations, sorting and searching, divide-and-conquer, dynamic programming, greedy algorithms, NP-completeness. Also listed as COMP 3804. Prerequisite(s): COMP 2002 or COMP 2402, and either COMP 1805 or both of MATH 2007 and MATH 2108 or equivalents.Lectures three hours a week.


There are no comments for this course.