Skip to Content
Sinclair College


Find info & services specific to you:


MAT 2570 Discrete Mathematics

Discrete Mathematics for Computer Science. Topics include formal logic, proofs, sets, combinatorics, graphs, trees, Boolean algebras, and base-n arithmetic.

Division: Science, Mathematics and Engineering
Department: Mathematics
Repeatable Credit: No
Offered Online: No

Prereqs: MAT 1460 OR MAT 1470 OR MAT 1580 


  • Demonstrate the proper use of set notation, set operations, counting principles, graphs, trees, and a knowledge of the associated terminology.
  • Define and apply inductive/deductive reasoning; identify logical statements and connectives; identify faulty reasoning and construct truth tables. Construct direct proofs, proofs by contradiction, by contraposition, or by induction.
  • Identify Boolean algebras, prove their properties, convert between logic networks and Boolean expressions and truth functions, and minimize the canonical sum-of-products form for a truth function.

Credit Hours: 4

Classroom Hours: 4