CSC 430 - Algorithm Design and Analysis, 3 credit hours

Prerequisite(s): CSC 245 with a “C” or better.
Building on concepts of basic algorithm design and complexity analysis introduced in earlier courses, this course explores advanced algorithm design and analysis. Topics may include advanced data structures, inductive algorithms, graph algorithms, geometric, algebraic, and numeric algorithms, reductions, NP-completeness, and parallel algorithms. Emphasis is placed on formal efficiency analysis of algorithms utilizing concepts from discrete mathematics.