Loading...

Course Description

Introduction to discrete structures as they apply to design and analysis. Review of proof techniques. Induction and recursion. Graphs and trees, and their applications in computing. Finite automata and regular expressions. Counting: arithmetic and geometric progressions, permutations and combinations, modular arithmetic.

Requisites

Prerequisite: CCPS 305, CMTH 110
Antirequisite: MTH 210
Loading...
Course Sections
Class Number
3268
Type
LEC
Days
M, W
Time
6:00PM to 10:00PM
Dates
May 06, 2024 to Jun 19, 2024
Schedule
View Details
Contact Hours
52.0
Location
  • Downtown
Delivery Options
Classroom  
Fees
Domestic Fee non-credit $854.56 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