MATH 301 Discrete Mathematics • 5 Cr.


This class introduces basic discrete structures in mathematics, computer science and engineering fields. Topics include elementary logic, set theory, mathematical proof, relations, combinatorics, induction, recursion, sequence and recurrence, trees, graph theory. Prerequisite: MATH 208 with a C or better and admission to BS CS program, or entry code.


After completing this class, students should be able to:

  • Evaluate, interpret, and reduce statements presented in Boolean logic and natural language.  Apply truth tables and the rules of propositional and predicate calculus. 
  • Formulate and solve discrete mathematics problems involving permutations and combinations of a set, recursion, and other fundamental enumeration principles (including recursion). 
  • Construct proofs throughout the course using direct proof, proof by contraposition, proof by contradiction, proof by cases, and mathematical induction. 
  • Apply (and analyze) algorithms and use definitions to solve problems and prove statements in elementary number theory and graph theory.