MAT 135 - Discrete Mathematics
Credits: 3
3 Lecture Hours
Prerequisites: MAT 108 or Equivalent
Description
This course is recommended for transfer students. Students examine set theory, Boolean algebra, elementary number theory and methods of proof. In addition, students learn to perform mathematical sequences, induction, functions, relations, counting techniques and graph theory.
Learning Outcomes
Upon successful completion of the course, the student will:
- Construct truth tables.
- Perform Boolean operations.
- Construct proofs for existential, universal and conditional statements.
- Perform modular arithmetic and set operations.
- Analyze properties of functions and relations.
- Construct proofs of statements using mathematical induction.
- Evaluate recursive and non-recursive sequences.
- Solve combinatoric problems.
- Apply concepts of graph theory to flow problems.
Listed Topics
- Logic and Boolean operations
- Elementary number theory and methods of proof
- Sequences and mathematical induction
- Set theory
- Functions
- Relations
- Counting techniques and probability
- Graph theory
Reference Materials
Each student is required to have access to the textbook, ebook or online homework platform adopted by the Mathematics Department at the specific campus. Calculator use is at the discretion of the instructor.
Students who successfully complete this course acquire general knowledge, skills and abilities that align with CCAC’s definition of an educated person. Specifically, this course fulfills these General Education Goals: - Critical Thinking & Problem Solving
- Quantitative & Scientific Reasoning
Approved By: Dr. Quintin B. Bullock Date Approved: 03/18/2024
Last Reviewed: 03/18/2024
Course and Section Search
Add to Portfolio (opens a new window)
|