This course is an introduction to discrete mathematical structures and their applications, intended for Computing Science majors especially but not exclusively. Topics include sets, propositions, permutations, combinations, relations, functions, graphs, paths, circuits, trees, recurrent relations, and Boolean algebra.
Prerequisite: MATH 114 and COMP 113, or equivalent
Note: This course is the same as COMP 220 - Introduction to Discrete Structures