header

MATH 210 – Introduction to Discrete Mathematics

Cr: 5 Wkly hrs: 5 hours Lecture
NS - Basic logic, number theory, sequences and series, induction. Counting: Permutations, combinations, probability, and binomial theorem. Solving recurrence relations, graphs and trees. (Same as CS 210)

Prerequisite: Math& 142 or Math& 144 within the last 6 years with a grade of 2.0 or above or satisfactory placement test score.

Rev.: June 15, 2012 Karen Osborn