CPSC413
Download as PDF
Design and Analysis of Algorithms I
Computer Science
SC - Faculty of Science
Subject
CPSC - Computer Science
Description
Techniques for the analysis of algorithms, including counting, summation, recurrences, and asymptotic relations; techniques for the design of efficient algorithms, including greedy methods, divide and conquer, and dynamic programming; examples of their application; an introduction to tractable and intractable problems.
Prerequisite(s): Computer Science 331; and 313 or 351; and Mathematics 211 or 213; and 3 units from Mathematics 249, 265 or 275.
Notes: Students who have credit for Computer Science 319 instead of Computer Science 331 should contact the department for instructions on how to enrol in this course.
Prerequisite(s): Computer Science 331; and 313 or 351; and Mathematics 211 or 213; and 3 units from Mathematics 249, 265 or 275.
Notes: Students who have credit for Computer Science 319 instead of Computer Science 331 should contact the department for instructions on how to enrol in this course.
Course Attributes
Fee Rate Group(Domestic) - A, Fee Rate Group(International) -A, GFC Hours (3-2T)
Courses may consist of a Lecture, Lab, Tutorial, and/or Seminar. Students will be required to register in each component that is required for the course as indicated in the schedule of classes. Practicums, internships or other experiential learning modalities are typically indicated as a Lab component.
Component
LEC
Component
TUT
Units
3
Repeat for Credit
No
Subject code
CPSC