MATH210 — Discrete Mathematics

(M1 905; CS 915) It provides an introduction to the analysis of finite collections and the foundations of sequential machines, data structures, and algorithms. Topics include: sets, logic, Boolean algebra, and logic circuits; counting; recursion; and graph theory, trees, and networks.

Prerequisites: MATH151

Part of

• Courses Approved for Transfer
• The General Education Core
• Computer Science-Technical Emphasis, A.A.

Source ↗

← back to prairiestate catalog