Description
An introduction to the design and analysis of algorithms. Topics include: divide-and-conquer, dynamic programming, linear programming, greedy algorithms, graph algorithms, NP-completeness.
Prerequisites
- Prerequisite(s): COMP 2402 and one of ( COMP 2804 or COMP 3805 or MATH 3825 or MATH 3855 ).
Conditions and arrangements
- Also listed as MATH 3804 .
- Prerequisite(s): COMP 2402 and one of ( COMP 2804 or COMP 3805 or MATH 3825 or MATH 3855 ).
- 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: divide-and-conquer, dynamic programming, linear programming, greedy algorithms, graph algorithms, NP-completeness.
- Prerequisite(s): COMP 2402 and one of ( COMP 2804 or COMP 3805 or MATH 3825 or MATH 3855 ).
- Also listed as MATH 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/COMP/