Computer Science

CSC 133: Discrete Mathematical Structures

Course Description:

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. Three lecture hours each week. Satisfies University Studies I: Foundations/Mathematics and Statistics. Satisfies University Studies IV: Building Competencies/Quantitative and Logical Reasoning.


MAT 111 or MAT 115, or equivalent.

Current Semester Pages:

  • Section 001: Mr. Kevin Carlin
  • Section 002: Mr. Kevin Carlin
  • Section 003: Mr. Kevin Carlin