CSC 8050 - Design and Analysis of Algorithms

3 cr.

This course introduces the concepts of computational complexity and the complexity classes P and NP. Topics covered include sorting and searching algorithms, graph algorithms, string matching, NP-completeness problems and dynamic programming techniques.

Prerequisite(s): CSC 7013 and Pass the Placement Test or CSC 7131