Csus/resource/course/cpsc 413

From wiki.ucalgary.ca
< Csus‎ | resource
Revision as of 21:06, 13 December 2014 by Cmah (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

CPSC 413
Design and Analysis of Algorithms I

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.

Course Notes

Previous Course Materials

Previous Tutorial Materials

Programming Languages

External Links