CS208 - Discrete Mathematics

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

Credit hours: 3.0
Lecture hours: 3.0

Course Notes:

  • Listed prerequisite: A grade of C or better in any math course, or an ACT math score of 23 or better, or an SAT math score of 150 or better, or a College Level math test score of 89 or better

Search Course Availability