CS 5720 - 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, and graph manipulation. Tractability: Class P and NP, NP-complete problems. Prer., CS 1450 and MATH 2150. Graduate students only. Meets with CS 4720.