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

On-campus exam requirement: Beginning Fall 2022, your final exam will be written in person at the Toronto Metropolitan University campus. If you live more than 100 km from the TMU campus, you may arrange to write your exam off campus using an approved off-campus invigilation service. Details on how to arrange off-campus invigilation will be provided prior to the first day of class. Details on the date of your exam can be found on the Exams for Online Courses webpage.

Requisites

Prerequisites: (CCPS 305 and MTH 210) or (CCPS 305 and CCPS 420)
Antirequisite: CPS688
Loading...
Course Sections
Class Number
1117
Type
LAB
Days
W, M
Time
6:00PM to 10:00PM
Dates
Jun 21, 2023 to Aug 09, 2023
Schedule
View Details
Contact Hours
52.0
Location
  • Online
Delivery Options
online  
Fees
Domestic Fee non-credit $885.29 Click here to get more information
Domestic Out of Province Fee non-credit $0.00 Click here to get more information
International Fee non-credit $0.00 Click here to get more information