Csus/resource/course/cpsc 413
From wiki.ucalgary.ca
CPSC 413
Design and Analysis of Algorithms I
Contents
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
- Course description - 2013/2014 course description
- Course outline - Winter 2013 course outline
Previous Tutorial Materials
Programming Languages
External Links
- Problem Solving with Algorithms and Data Structures - An interactive, online ebook on data structures, algorithms, and analysis.
- Data Structures and Algorithms in Java - Comprehensive collection of algorithms implemented in Java.
- Design and Analysis of Algorithms - Algorithms explained and coded
