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: MATH 211 OR 263A & NOT C S 300

Credit Hours: 4
Repeat/Retake Information: May be retaken three times excluding withdrawals, but only last course taken counts.

Add to Portfolio.

Close Window