Description
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.
Prerequisites
- 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 .
Conditions and arrangements
- 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.
Reference text in its original language
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.
- 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 .
- Also listed as COMP 3804 .
- Lectures and tutorials three to four and a half hours a week.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/MATH/