MATH 126 - Basic Discrete Mathematics

Credits: 3 Total Hours: 60

This course, which primarily targets mathematics and computer science students, provides an introduction to discrete mathemtatics. Topics include logic, proof techniques including mathemtatical induction, basic set theory, functions, cardinality of sets, asymptotic notation, properties of integers, permutations and combinations, pigeonhole principle, recursive definitions, divide and conquer recurrence relations and a brief introduction to graphs.

Prerequisites
One of:

C in MATH 100
C in MATH 125