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.

Course 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.

Prerequisite Courses

Additional Information

This course fulfills the following GE requirements: AAOT Science/Math Non-Lab, AS Math, AAS Math/Computation, AGS Math/Science, AAOT Math