Discrete Mathematics

Catalog description

A problem-centered introduction to topics in discrete mathematics including induction, permutations, combinations, graphs, recurrence relations and generating functions. Typically offered Fall. Prerequisite(s): MA 16400 FOR LEVEL UG WITH MIN. GRADE OF C- Course Learning Outcomes 1. Understand basic logic and have the ability to write simple proofs, including proofs by induction. 2. Demonstrate a knowledge of basic set theory and relations on sets. 3. Understand basic combinatorics and use it to solve counting problems. 4. Understand basic concepts of graph theory and have the facility to apply graph theoretic models. View Class Schedule