| |
Dec 30, 2024
|
|
|
|
|
Website Catalog (In Development)
|
MAT 250 - Discrete Mathematics
Sets, functions, mathematical induction, relations, partially ordered sets, combinatorics including permutations, the pigeonhole principle, binomial and multinomial coefficients, recurrence relations, generating functions, the principle of inclusion-exclusion. Graph theory, including paths and connectedness, minimum length paths, Eulerian and Hamiltonian graphs, graph isomorphisms, trees, planar and nonplanar graphs.
Prerequisite- Corequisite
Prerequisite: MAT 181 Calculus I
Credits: 4
Hours
4 Class Hours
Course Profile
Learning Outcomes of the Course:
Upon successful completion of this course the student will be able to:
- Interpret and write proofs of propositions from various fields of Mathematics using a range of proof styles and structures.
- Use basic principles of various discrete mathematical structures that are built from set theory.
- Apply basic theorems and principles of counting and probability to various problems.
- Apply basic theorems and principles of graph theory to various problems.
|
|
