CS/MAT 165 - Introductory Discrete Mathematics
4 semester hours
An introduction to discrete structures and processes such as
counting, algorithms, proof, induction and recursion through the
study of logic, sets, relations and functions. Sufficient theory is
introduced for applications to graph theory and elementary computer
science.
Prerequisite: MAT 133 or equivalent,
CS 170 (co-requisite)






