MAT 132 - Discrete Mathematics

Class: 3 Credits: 3
This course includes the following topics: mathematical logic and proofs; set operations; relations and digraphs; functions; recurrence relations; and combinatorics. (This course is designed primarily for computer science students.)

Prerequisite(s): Take MAT 110 with a minimum grade of “C”.

Course Topics:

Logic and Sets
Basic Proof Writing
Elementary Number Theory including Indexed by Integers: Sequences
Relations and Functions
Basic Counting: Combinatorics
Basic Graph Theory

Textbooks:
Textbook information can be found on the Book Inn Web site

Required Materials:

Texas Instruments TI-83 or TI-84 graphing calculator.
Any other device must be approved by the instructor of the course.

Grading System:
A 90-100
B 80-89
C 70-79
D 60-69
F 0-59

Student Learning Outcomes:

Assess the validity of an argument using symbolic logic or truth tables
Prove logical statements using the most appropriate method which may include if-then, contradiction, or splitting into cases.
Identify terms of a sequence by using a closed form equation or a recursive formula
Apply the definition of relations and functions to determine if a function is one-to-one, onto, or bijective.
Apply fundamental counting principles to solve combinatorial problems.
Demonstrate a working knowledge of graph theory using paths, circuits or trees.

For SCC Online Courses:
If the course you are taking is online, please review the SCC Online Course Policies that include:

Identity Verification
Required materials for all online courses
Mandatory Attendance Requirement
Orientation and Support
Proctored Exams

Standard SCC Course Policies:
Please review the Standard Course Policies on the following topics:

Academic Integrity
Add/Drop period
Attendance
Classroom Conduct
Equal Access
IT Access
Online Behavior
Online Confidentiality
Services For Students with Disabilities
Student Concerns
Student Help Services
Withdrawals

Official Course Syllabus
2022-2023