MATH 3050 - Discrete Mathematics


Introduction to discrete mathematical structures and their applications. The main topics are induction and recursion, graph theory and counting techniques. Applications include discrete and network optimization, discrete probability, game theory, and voting systems.

Requisites: C or better in MATH 2301 or 263B
Credit Hours: 3.0
Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts.
Lecture/Lab Hours: 3.0 lecture
Eligible grades: A-F,WP,WF,FN,FS,AU,I


Print-Friendly Page (opens a new window)