Mathematics (MATH)
School of Mathematics and Statistics
Faculty of Science
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, amortized analysis. (Also listed as
COMP 3804.)
Prerequisites:
COMP 2002, and either
COMP 2805 or both of
MATH 2007 and
MATH 2108 or equivalents.
Lectures three hours a week.