Description
A second course on the design and analysis of algorithms. Topics include: advanced recurrence relations, algebraic complexity, advanced graph algorithms, amortized analysis, algorithms for NP-complete problems, randomized algorithms.
Prerequisites
- Prerequisite(s): COMP 3804 or MATH 3804 .
Conditions and arrangements
- Prerequisite(s): COMP 3804 or MATH 3804 .
- Lectures three hours a week.
Reference text in its original language
A second course on the design and analysis of algorithms. Topics include: advanced recurrence relations, algebraic complexity, advanced graph algorithms, amortized analysis, algorithms for NP-complete problems, randomized algorithms.
- Prerequisite(s): COMP 3804 or MATH 3804 .
- Lectures three 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/