University of Calgary

CPSC 413 - Design & Analysis Of Algorithms I - Fall 2011

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 253, 263 or 283 is highly recommended 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.


  • Computer Science 331 or both Computer Science 319 and 105 and Computer Science 313, and one of Mathematics 211, 213 or 221, and one of Mathematics 249, 251, 261 or 281.


This course will be offered next in Winter 2012.
Powered by UNITIS. More features.