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): i) one of COMP 2402 or SYSC 2100; and ii) 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.
Prerequisite(s): i) one of COMP 2402 or SYSC 2100; and ii) 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.