# MTH 231 : Discrete Mathematics

## Transcript title

Discrete Mathematics

4

40

40

## Description

Topics in the course will examine in detail the applied, real-world and theoretical mathematical implications of the mathematical concepts elementary logic and set theory, functions, direct proof techniques, contradiction and contraposition, mathematical induction and recursion, elementary combinatorics, basic graph theory, minimal spanning trees. The symbolic, numerical and graphical representations of the mathematical concepts will be expanded and explored. Emphasis will be on solving problems symbolically, numerically and graphically and understanding the connections among these methods in interpreting and analyzing results.

## Learning outcomes

1. Apply basic set operations.
2. Negate compound and quantified statements and form contrapositives.
3. Construct a direct proof (from definitions) of simple statements.
4. Apply the Principle of Mathematical Induction.
5. Construct indirect proofs by contraposition and contradiction.
6. Construct explanations for solutions to counting problems.
7. Utilize one or more algorithm for finding a shortest path or a minimal spanning tree in a connected graph.

## General education/Related instruction lists

• Discipline Studies/Science No Lab
• Foundational Skills/Mathematics

## Outside of expected

Use the COCC Catalog to find extraordinary classes and degree programs. Start your journey here »