Course Number and Title: MAT 263 Principles of Discrete Mathematics
This course is a study of sets, logic, induction, the integers, functions, sequences, counting, and an introduction to graph theory. Proofs are emphasized throughout the course.
- Develop a foundation of mathematical logic. (CCC 2, 6)
- Perform operations on discrete structures. (CCC 2, 6)
- Determine the properties of functions. (CCC 2, 6)
- Formulate solutions using combinatorics. (CCC 2, 6)
- Apply graph theory to abstract modeling. (CCC 2, 6)
- Construct mathematical proofs. (CCC 1, 2, 6)
See Core Curriculum Competencies and Program Graduate Competencies at the end of the syllabus. CCPOs are linked to every competency they develop.
Upon completion of this course, the student will:
- Develop a foundation of mathematical logic.
- Identify statements and logical equivalence.
- Construct compound statements using quantifiers and connectives.
- Determine the validity of an argument.
- Perform operations on discrete structures.
- Apply the division and Euclidean algorithms.
- Construct the greatest common divisor and least common multiple of two integers.
- Relate concepts of prime, relatively prime, and congruence.
- Compute, write, and transform sequences.
- Solve a recursive sequence using the characteristic polynomial.
- Determine the properties of functions.
- Perform set operations.
- Construct binary relations from the Cartesian product of two sets and deduce their properties.
- Assess the characteristic(s) of a function, including one-to-one and onto.
- Find the inverse of a function, if it exists, and state the domain and range.
- Find the composition of functions, and state the domain and range.
- Apply concepts of functions to discover the cardinality and countability of a given set.
- Define an equivalence relation, and apply it to the partition of a set.
- Formulate solutions using combinatorics.
- Apply the principles of inclusion and exclusion.
- Apply permutations and combinations.
- Apply the binomial theorem.
- Apply principles of counting to probability.
- Apply graph theory to abstract modeling.
- Identify the characteristic(s) of a graph.
- Demonstrate whether an isomorphism exists between two graphs.
- Demonstrate whether a graph contains Hamiltonian cycles or Euler circuits.
- Employ diagrams to illustrate characteristics of trees.
- Construct mathematical proofs.
- Construct proofs involving integers and rational numbers.
- Apply mathematical induction to proofs involving sequences.
- Prove set equivalence using the element argument and Boolean algebra.
- Construct proofs involving inverse and composition of functions.
- Apply the principles of induction.
- Construct sequences defined recursively and formulate the associated characteristic polynomial.
Students must demonstrate proficiency on all CCPOs at a minimal 75 percent level to successfully complete the course. The grade will be determined using the Delaware Tech grading system:
Students should refer to the Student Handbook for information on the Academic Standing Policy, the Academic Integrity Policy, Student Rights and Responsibilities, and other policies relevant to their academic progress.
- Apply clear and effective communication skills.
- Use critical thinking to solve problems.
- Collaborate to achieve a common goal.
- Demonstrate professional and ethical conduct.
- Use information literacy for effective vocational and/or academic research.
- Apply quantitative reasoning and/or scientific inquiry to solve practical problems.
The College is committed to providing reasonable accommodations for students with disabilities. Students are encouraged to schedule an appointment with the campus Disabilities Support Counselor to request an accommodation needed due to a disability. A listing of campus Disabilities Support Counselors and contact information can be found at the disabilities services web page or visit the campus Advising Center.