MAT236 — Discrete Structures (M)

3 credits · 3 hours

Semester pring only Discrete Structures introduces the fundamental tools, topics, and concepts of discrete mathematics. This course emphasizes counting methods, proof techniques, and problem-solving strategies. Topics include Boolean algebra, set theory, symbolic logic, predicate calculus, number theory, the methods of proofs (direct, indirect, and inductive), objective functions, equivalence relations, graphs, set partitions, combinatorics, modular arithmetic, summations, and recurrences. Prerequisite(s): MAT 201

Prerequisites: MAT201

Part of

• Computer Science, AS
• Engineering with Areas of Concentration, AS
• Data Science, AS
• Mathematics, AS

Source ↗

← back to cecil catalog