Computer Science 413: Design and Analysis of Algorithms I

CPSC 413: Design and Analysis of Algorithms I

Topics

1. Introduction to Course and Mathematics Review
2. Introduction to the Analysis of Algorithms
3. Algorithm Design: Divide and Conquer
4. Algorithm Design: Dynamic Programming and Memoization
5. Algorithm Design: Greedy Algorithms
6. Introduction to Computational Complexity Theory

Other Course Information

• Information about Assignments
• Information about Tests

cpsc 413 computer science faculty of science u of c

CPSC 413 Introduction Analysis of Algorithms Divide and Conquer Dynamic Programming Greedy Algorithms Computational Complexity Information about Assignments Information about Tests