Apr 01, 2023
2022-2023 Catalog
 Select a Catalog 2022-2023 Catalog 2021-2022 Catalog [ARCHIVED CATALOG] 2020-2021 Catalog [ARCHIVED CATALOG] Spring 2020 Catalog [ARCHIVED CATALOG] 2019-2020 Catalog [ARCHIVED CATALOG] Spring 2019 Catalog [ARCHIVED CATALOG] Fall 2018 Catalog [ARCHIVED CATALOG] Spring 2018 Catalog [ARCHIVED CATALOG] Fall 2017 Catalog [ARCHIVED CATALOG] Spring 2017 Catalog [ARCHIVED CATALOG] Fall 2016 Catalog [ARCHIVED CATALOG] Spring 2016 Catalog [ARCHIVED CATALOG] Fall 2015 Catalog [ARCHIVED CATALOG] Spring 2015 Catalog [ARCHIVED CATALOG] Fall 2014 Catalog [ARCHIVED CATALOG] Spring 2014 Catalog [ARCHIVED CATALOG] Fall 2013 Catalog [ARCHIVED CATALOG] Spring 2013 Catalog [ARCHIVED CATALOG] Fall 2012 Catalog [ARCHIVED CATALOG] 2011-2012 Catalog [ARCHIVED CATALOG] 2008-2010 Catalog [ARCHIVED CATALOG]
 HELP 2022-2023 Catalog Print-Friendly Page (opens a new window)

# MT 167 - Discrete Mathematics

Credit Hours: 4

This course is intended for computer science students and as a general mathematics elective for other students. Topics include logic, sets, relations, functions, recursion, mathematical induction, counting methods, difference equations, series and sequences.

Course Outcomes
Upon completion of this course, the student will be able to:

• recall and apply the basic logic principles;
• recognize and construct logically valid arguments;
• solve problems involving set operations;
• analyze, construct and apply binary relationships;
• design graphs and digraphs;
• determine an isomorphism;
• perform mathematical induction to prove basic problems;
• recognize and use the process of recursion;
• prove a relation is an equivalence relation;
• represent relations as Matrices and Digraphs;
• to understand the Konigsberg problem;
• understand growth and order notation; and
• perform operations with sequences and series.

Prerequisites: MT 126 or waived from placement test or placed into degree credit math.
F (N)