CS 4245 - Analysis of Algorithms

Units: 4
Design, analysis and implementation of algorithms. Methods of algorithm design, including recursion, divide and conquer, dynamic programming, backtracking. Time and space complexity analyses in the best, worst, and average cases. NP-completeness; computationally hard problems. Applications from several areas of Computer Science. Prerequisites: MATH 1305 , MATH 2101 , CS 3240.