|
|
|
Apr 23, 2024
|
|
MATH 2103 - Discrete Mathematics 3 Credits
This course includes topics that are fundamental tools for higher mathematics, especially those courses that are discrete, rather than continuous, in nature. The topics covered in this course are also essential to applications in computer sciences and modern technology. Topics include set theory, relations and functions, proofs by induction and contradiction, formal logic and truth tables, graph theory, Boolean and matrix algebra, combinatorics, and probability.
Prerequisite: MATH 1123 - College Algebra* with a grade of “C” or better.
Course Level Objectives
Upon successful completion of this course the student will be able to:
1. Analyze the truth of statements and combinations of statements using truth tables. (GEO 2. 3)
2. Prove statements true using induction or contradiction, and false by finding explicit counterexamples. (GEO 2, 3)
3. Demonstrate the validity of set operations using Venn Diagrams and prove the validity of those operations using set theory proof methods. (GEO 2, 3)
4. Describe relations between sets as functions, equivalence relations, and/or partial order relations, to classify the relation as one-to-one, onto, or neither, and to demonstrate the relation using mappings. (GEO 1, 2, 3)
5. Draw and analyze directed graphs and tree graphs. (GEO 3)
6. Calculate probability using basic combinatoric principles. (GEO 3)
Add to Portfolio (opens a new window)
|
|
|