University of Calgary

CPSC 413 - Design and Analysis of Algorithms I - Spring 2019

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 credit for Computer Science 319 instead of Computer Science 331 should contact the department for instructions on how to enrol in this course.


  • Computer Science 313, 331; Mathematics 211 or 213; and one of Mathematics 249, 265 or 275.


  • LEC 1TR 09:00 - 11:45
    Jonathan Hudson
    TUT 1TR 15:00 - 16:50
    TUT 2TR 17:00 - 18:50
This course will be offered next in Fall 2019.
Powered by UNITIS. More features.