# MTH 136 DISCRETE MATHEMATICS

**MTH 136 – Discrete Mathematics**

**Course Outline**

**Course Number & Name:** MTH 136 Discrete Mathematics

**Credit Hours: **3.0 **Contact Hours: ** 3.0 **Lecture:** 3.0 **Lab: ** N/A **Other: ** N/A

**Prerequisites**: Grade of “C” or better in MTH 113 or MTH 119 or placement

**Co-requisites:** None **Concurrent Courses:** None

**Course Description**: This is a course in finite mathematical structures relevant to computer science and computer information systems. Topics include sets, relations, functions, graphs, trees, methods of proof including mathematical induction, Boolean algebras and their use in circuit design, elementary combinatorics, coding theory and formal languages.

**General Education Goals**: MTH 136 is affirmed in the following General Education Foundation Category: **Quantitative Knowledge and Skills. **The corresponding General Education Goal is as follows: Students will use appropriate mathematical and statistical concepts and operations to interpret data and to solve problems.

**Course Goals: **Upon successful completion of this course, students should be able to do the following:

- demonstrate knowledge of the fundamental concepts and theories from discrete mathematics;
- utilize various discrete math problem-solving and critical-thinking techniques to set up and solve applied problems in finance, economics, geometry, sciences, and other fields; and
- communicate accurate mathematical terminology and notation in written and/or oral form in order to explain strategies to solve problems as well as to interpret found solutions.