Loading...

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.

Requisites

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

Course Sections

Class Number
1094
Type
LEC
Days
M, W
Time
6:00PM to 10:00PM
Dates
May 04, 2020 to Jun 17, 2020
Schedule
Contact Hours
52.0
Location
  • Downtown
Delivery Options
Classroom  
Compulsory Fees
Domestic Fee non-credit $873.77 Click here to get more information
International Fee non-credit $0.00 Click here to get more information