Skip to main content

CPS 616

Algorithms

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.
Weekly Contact: Lab:1 hr. Lecture:3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1

Prerequisites

(CPS 305 and MTH 210) or (CPS 305 and CPS 420)

Antirequisites

None

Co-Requisites

None

Custom Requisites

None

Mentioned in the Following Calendar Pages

*List may not include courses that are on a common table shared between programs.

Computer Science