MATH 320 - Discrete Mathematics
3 Credits
Description
Sets, relations, functions, graphs, trees, and networks; propositional and predicate logic; combinatorial methods; recursion and iteration; applications of discrete structures that could include linear programming and designing data structures.
Prerequisites
A grade of C or better in MATH 132.
Click here for the Fall 2025 Class Schedule
Click here for the Spring 2026 Class Schedule
Click here for the Summer 2026 Class Schedule
Add to Portfolio (opens a new window)
|