Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio.

MATH 308 - Discrete Mathematics

Introduction to discrete mathematical structures and their application. The main topics are induction, recursion, graph theory, and combinatorics. Applications include discrete and network optimization, discrete probability, game theory and voting systems.
Prerequisites: C OR BETTER IN MATH 263A

Credit Hours: 4
Repeat/Retake Information: May be retaken three times excluding withdrawals, but only last course taken counts.
Print-Friendly Page (opens a new window)
Add to Portfolio.
Close Window