CS422 ALGORITHMS DESIGN AND ANALYSIS (3
Cr.)
COURSE DESCRIPTION
Prerequisite:
CS222 and one of MA161 or
MA271
Offered: Winter
General Introduction and Goals
This course covers advanced algorithms and data structures, formal analysis of
algorithm complexity, and the theory of computation. Topics can include algorithms design
technique (e.g., divide-and-conquer, dynamic programming), upper bounds and lower bounds,
graph algorithms, geometric algorithms, symbolic and numeric algorithms, string matching,
NP-completeness, complexity classes, computability and undecidability and parallel and
distributed algorithms. Students finishing this course will learn the basic skills of
designing and analyzing sequential and parallel algorithms.
|






|