CMPU 241 - Analysis of Algorithms

Semester Offered: Fall and Spring
1 unit(s)

Introduces the systematic study of algorithms and their analysis with regard to time and space complexity. Topics include divide-and-conquer, dynamic programming, greediness, randomization, upper and lower-bound analysis, and introduction to NP completeness. Emphasis is placed on general design and analysis techniques that underlie algorithmic paradigms. Builds a foundation for advanced work in computer science.

Prerequisites: CMPU 102 and CMPU 145.

Two 75-minute periods.