MTH 231 Elements Of Discrete Math
An introductory course in discrete mathematics covering elementary logic and set theory, functions, relations, direct and indirect proof techniques, mathematical induction, recursion, elementary combinatorics, basic graph theory, and minimal spanning trees. Applications of these topics in computer science are stressed.
Prerequisite
Prerequisite: MTH 112 Trigonometry or equivalent and MTH 251 Differential Calculus with a grade of C or better
Offered
Offered Winter only
Notes
Lower Division Transfer (LDT) Course
General Education Requirements
AAOT Science/Math Non Lab, AS Math, AAS Math/Computation, AGS Math/Science, AAOT Math,
Outcomes
Upon successful completion of this course, students will be able to:
Apply the definitions of elementary set theory to finite and infinite sets. Construct both negations and contrapositives of compound and qualified statements using propositional calculus. Construct both direct proofs (from definitions) and indirect proofs of simple statements. Apply the First and Second Principles of Mathematical Induction to construct proofs of appropriate mathematical statements. Construct and explain solutions to elementary combinatorics problems. Relate concepts of elementary graph theory to problems in computer science.