University of Calgary

CPSC 413 - Design & Analysis of Algorithms I - Fall 2017

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.
This course may not be repeated for credit.


  • H(3-2T)


  • One of Mathematics 265 or 275 is highly recommended as preparation for this course, but not mandatory. Students who have completed Computer Science 319 instead of Computer Science 331, and who have been unable to complete Computer Science 105, should contact the Department of Computer Science for information about how to be prepared for, and how to be eligible to take, Computer Science 413.


  • Either Computer Science 331 or both Computer Science 319 and 105, Computer Science 313, one of Mathematics 211 or 213, and one of Mathematics 249, 251, 265, 275, 281 or Applied Mathematics 217.


  • LEC 1TR 09:30 - 10:45
    Wayne Michael Eberly
    TUT 2MW 11:00 - 11:50
    TUT 3TR 14:00 - 14:50
    TUT 4MW 17:00 - 17:50
This course will be offered next in Winter 2018.
Powered by UNITIS. More features.