|
Nov 22, 2024
|
|
|
|
MAT 167 Discrete Mathematics (3 Credit Hours) Class Hours: 3 Lab Hours: 0 Clinical/Work Experience Hours: 0 Prerequisites: Take One: MAT 121 or MAT 171 Corequisites: None This course is designed to develop problem-solving and reasoning skills using an algorithmic approach. Topics include sets, number theory, numeration systems, linear programming, traditional and propositional logic, truth tables, Venn diagrams, elementary proofs, and Boolean algebra. Upon completion, students should be able to apply logic and other mathematical concepts to solve a variety of problems.
Competencies
Student Learning Outcomes
- Construct and use truth tables to solve logical problems.
- Solve application problems in set theory using appropriate notation.
- Set up and solve linear programming problems using various appropriate methods.
- Construct elementary direct proofs, indirect proofs, and proofs by contradiction.
- Analyze, construct, and verify algorithms.
- Formulate and assess Boolean functions.
Add to Portfolio (opens a new window)
|
|