CS 208 - Discrete Mathematics

Crosslisted: MA 208

This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques.
Prerequisite(s): A grade of C or better in any math course ≥ MA 125, or an ACT math score ≥ 23, or an SAT math score ≥ 510, or College Success Algebra test score ≥ 110.
Lecture Hours: 3 Lab Hours: 0 Credits: 3