CS 321: Algorithms

Course Description

An introduction to the design and analysis of algorithms. Algorithm analysis topics include asymptotic analysis, recurrence relations, loop invariants, and amortized analysis and parallel algorithms. Algorithm design techniques include divide and conquer, the greedy method, and dynamic programming. Additional topics include graph algorithms and NP-completeness. Prerequisite: A grade of C or better in COMP SCI 212 or 281 and COMP SCI 271. Special course fees may apply.