MATH 210 Discrete Mathematics

(M1 905; CS 915)
Prerequisite: MATH 151 with a ‘C’ or better or placement via multiple measures
3 lectures per week: 3 hrs transfer credit
This is the first course in the study of discrete mathematical processes and structures. It provides an introduction to the analysis of finite collections and the foundations of sequential machines, data structures, and algorithms. Topics include: sets, logic, Boolean algebra, and logic circuits; counting; recursion; and graph theory, trees, and networks.