Feb 22, 2020
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.
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 equivalent and/or appropriate mathematics level code.*
*Level code is determined by Mathematics Department placement test and/or successful completion of math courses.