MAT 481 - Discrete Mathematics

Primarily designed for both mathematics and computer science majors. While the calculus-based mathematics of classical engineering and physical science is essentially “continuous,” the finite mathematics of computer science and some social sciences is essentially “discrete” or “combinatorial.” MAT 481 is an introductory course offered in this spirit. Topics covered typically include graphs and networks, analysis of algorithms, generating functions and recurrence relations, graph coloring, satisfiability, computational complexity, automata and languages, Turing machines and computability, and a brief introduction to the theory of NP-completeness.

Prerequisites & Notes
MAT 261 or MAT 262 or permission.

Credits: 3