CS422 ALGORITHMS DESIGN AND ANALYSIS (3 Cr.)

COURSE DESCRIPTION

Prerequisite: CS222 and one of MA161 or MA271

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.

CS101 CS120 CS120A CS122 CS201 CS222 CS228 CS295 CS297 CS298 CS302 CS322 CS326 CS330 CS370 CS422 CS424 CS426 CS442 CS444 CS446 CS460 CS470 CS480 CS490 CS491 CS495 CS496 CS497 CS498