Course Description

Complexity analysis and order notations, recurrence equations, brute force, divide-and-conquer techniques and the master theorem, transform-and-conquer and problem reduction, greedy method, dynamic programming, the knapsack and travelling salesman problems, graph algorithms, text processing and pattern matching techniques, P, NP, and NP-complete classes.


Prerequisites: (CCPS 305 and MTH 210) or (CCPS 305 and CCPS 420)

Thank you for your interest in this course. Unfortunately, this course currently isn't available.

Please browse our courses for more options or check back later for updated scheduling.