CSC 133 - Discrete Mathematical Structures
Introduction to discrete mathematics applicable to computer science. Propositional and predicate logic, basic proof techniques, set algebra and Boolean algebra, recursion and induction, and introductory graphs and combinatorics.
Credit Hours: 3
Prerequisite Courses: MAT 111 or MAT 115
University Studies: Foundations/Mathematics and Statistics
Course Repeatablility: Course may not be repeated. Maximum Repeatable Hours: 3
Click here for the Spring 2021 Class Schedule.