CS 4300  -  Algorithm Design and Analysis (3)

Techniques needed to analyze and design algorithms are discussed. It covers a large number of classical algorithms and their complexity. Topics such as sorting, graph algorithms, and NP-completeness are discussed.

  Prerequisite(s): CS 2300  with a grade of C or better and CS 2400  with a grade of C or better. An additional fee is associated with this course.