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 one of (COMP 2804 or MATH 3855 or MATH 3825 or COMP 3805). Lectures and tutorials three to four and a half hours a week. [0.5 credits]
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 one of (COMP 2804 or MATH 3855 or MATH 3825 or COMP 3805). Lectures and tutorials three to four and a half hours a week. [0.5 credits]
