MAD 3107 - Discrete Mathematics

Description
Introduction to concepts of discrete mathematics, as as used by computer scientists. Topics include symbolic logic and Boolean algebra, propositional and predicate calculus, sets, functions, and relations, enumeration and counting principles, introduction to graphs, trees, spanning trees, shortest path and matching algorithms, finite state automata, Turing machines. *Meets Gordon Rule for Math
Credits
3
Attributes
Computation Skills
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Spring 2019, Fall 2018, Spring 2018, Fall 2017
Offered
TuTh, MWF
Avg. Class Size
35
Avg. Sections
2