CampusAnswers

MAT250 — Discrete Math

MAT 250 - Discrete Math MAT 250 - Discrete Math 3 Course Description: An introductory course covering topics recommended for Computer Science: proof methods; formal logic and truth tables; sets and Boolean algebra; functions and relations; graphs; digraphs; trees; combinatorics; algorithms including recursion and induction. General Education Elective(s): Math all programs Note(s): N/A Course Student Learning

Prerequisites: MAT190, MAT195, MAT196

Part of

Source ↗

← back to middlesexma catalog