> Academics > Course
Descriptions > Undergraduate
MATH 3302 (3-3-0) Discrete Mathematics
A study of the basic techniques and modes of reasoning of combinatorial problem solving. Sets, functions, and algorithms; counting methods and recurrence relations; graph theory; trees; network models; Boolean algebra and combinatorial circuits. Fall.
Prerequisite: MATH 1303, 2309, and COSC 1405, or permission of instructor.