CS 4720 - Design and Analysis of Algorithms

3 Credits (Minimum) 3 Credits (Maximum)

Design methodologies; divide-and-conquer, exhaustive search, dynamic programming. Time and space complexity measures, analysis of algorithms. Survey of important algorithms for searching, sorting, graph manipulation. Tractability: class P and NP, NP complete problems. Prer., CS 1450 or GDD 2200 with a grade of “C” or better; CS 2150 or MATH 2150 with a grade of “C” or better. College of Engineering students only. Course typically offered: Fall, Spring