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): COMP 2402 and either COMP 2804 or (MATH 2007 and MATH 2108).
Lectures and tutorials three to four and a half hours a week.
Prerequisite(s): COMP 2402 and either COMP 2804 or (MATH 2007 and MATH 2108).
Lectures and tutorials three to four and a half hours a week.