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.

Notes

This course will require you to be online for live lectures every week at the scheduled time. Class recordings will also be available until after your exam period. More details will be included in your course outline available on the first day of class.

Requisites

Prerequisites: (CCPS 305 and MTH 210) or (CCPS 305 and CCPS 420)
Loading...
Course Sections
Class Number
2023
Type
LEC
Days
M, W
Time
6:00PM to 10:00PM
Dates
Jun 21, 2021 to Aug 04, 2021
Schedule
Contact Hours
52.0
Location
  • Online
Delivery Options
online  
Fees
Domestic Fee non-credit $884.55 Click here to get more information
International Fee non-credit $0.00 Click here to get more information