Computer Science (COMP)
School of Computer Science
Faculty of Science
COMP 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 MATH 3804.)Prerequisites: COMP 2002 or COMP 2402, and either COMP 1805 or both of MATH 2007 and MATH 2108, or equivalents.
Lectures three hours a week.
Summer session: some of the courses listed in this Calendar are offered during the summer. Hours and scheduling for summer session courses will differ significantly from those reported in the fall/winter Calendar. To determine the scheduling and hours for summer session classes, consult the class schedule at central.carleton.ca
Not all courses listed are offered in a given year. For an up-to-date statement of course offerings for the current session and to determine the term of offering, consult the class schedule at central.carleton.ca
