Feb 06, 2023
2017-2018
 Select a Catalog 2022 - 2023 Catalog 2021 - 2022 Catalog [ARCHIVED CATALOG] 2020 - 2021 Catalog [ARCHIVED CATALOG] 2019 - 2020 Catalog [ARCHIVED CATALOG] 2018 - 2019 Catalog [ARCHIVED CATALOG] 2017-2018 [ARCHIVED CATALOG]
 HELP 2017-2018 [ARCHIVED CATALOG] Print-Friendly Page (opens a new window)

# MTH 260 - Discrete Mathematics

Credits: 3
Introduces discrete mathematics topics for applied mathematics and computer science. Includes Boolean algebra, predicate logic, sets, relations, induction and recursion, counting theory, graphs and trees.

Prerequisite(s): MTH 161  with a grade of “C” or better.
Corequisite(s): None
Lecture Hours: 45 Lab Hours: 0
Meets MTA Requirement: Natural Science
Pass/NoCredit: Yes

Outcomes and Objectives
1. The student will learn the fundamental terms and vocabulary of mathematical discourse.
1. Use functions, sequences and summations.
2. Use the fundamental properties of the integers.
3. Use matrices in a variety of contexts.
4. Use the basic principles of mathematical logic.
5. Define, identify, and apply sets and set operations.
6. Use the concepts of algorithm, recursion, and iteration.
7. Use the concept of mathematical induction.
2. The student will learn the fundamental principles of counting.
1. Set-up and solve problems related to permutations and combinations.
2. Use generalized permutations and combinations.
3. Apply the basic rules of probability in solving problems.
4. Define, identify, and apply recurrence relations.
5. Use the principle of inclusion-exclusion.
3. The student will learn about relations and their representations.
1. Identify several fundamental properties of relations.
2. Use tables, graphs, and matrices.
3. Identify and define constructions of fundamental closures of relations.
4. Define and identify equivalence relation and partition.
5. Use various examples of partial orderings.
4. The student will learn the fundamental properties and applications of graphs and trees.
1. Use fundamental graph and tree terminology.
2. Identify several graphs.
3. Define, identify, and apply Euler and Hamilton paths.
4. Define, identify, and apply weighted graphs and shortest path problems.
5. Define and solve problems related to homeomorphism and isomorphism of graphs.
6. Define and solve problems related to tree traversal, spanning trees and minimal spanning trees.
5. The student will learn the fundamental properties and applications of Boolean algebra.
1. Define and represent Boolean functions.
2. Recognize various examples of Boolean algebras.
3. Identify and define logic gates and combinatorial circuits.
4. Apply algorithms for minimization of circuits.