COURSE OUTINE

MIDLANDS TECHNICAL COLLEGE

MAT 132 DISCRETE MATHEMATICS

3.OCredit Hours

COURSE DESCRIPTION: This course includes the following topics: Mathematical logic and proofs; set operations; relations and digraphs; functions; recurrence relations; and combinatorics. (This course is designed primarily for computer science students).
TEXT: Discrete Mathematics, 5th edition;  by Richard Johnsonbaugh; Prentice-Hall

PREREQUIISITE:  MAT 110

EQUIPMENT: Scientific Calculator (TI-83 or TI-83+ recommended)

MATHEMATICS DEPARTMENT ATTENDANCE REQUIREMENTS

DEFINITIONS:

ABSENCE - Failure to be present for a scheduled meeting of the class or arriving for the class more than ten minutes after the scheduled time for the class to begin.

TARDY --- Arrival to class after the instructor has called the roll and before ten minutes past the time scheduled for the class to begin.

I. Absences are counted from the first day of classes.

II. Five absences are allowed for a class that meets three times per week, and three absences are allowed for a class that meets two times per week.

III. Three tardies are considered as one absence. The student must meet with the instructor at the end of the class to which he has been late to have the absence changed to a tardy.

IV. There are no "excused" absences; all absences are counted, regardless of the reason for the absence.

V. A student missing class time by leaving early will also be counted absent.

Please note: You are responsible for all material and announcements presented, whether you are present or absent.

Mathematics Department

Airport: 822-3357

Beltline: 738-7689

Revised 3/7/07

GRADING SCALE

A 90 - 100      B 80 - 89    C 70 - 79    D 60 -69    F Below 60

 

MAT 132 Course Objectives

Students should be able to:

  1. To develop the ability to think abstractly, to understand what it means to reason from definitions, and to be able to use direct and indirect arguments.
  2. To utilize recursive thinking in solving problems and in verifying solutions by mathematical induction.
  3. To develop skills in combinatorial techniques in a variety of applications.
  4. To analyze discrete mathematical structures including sets, Boolean algebras, relations, graphs and trees.
  5. To solve applied problems utilizing the techniques of this course.
  6. To develop and demonstrate proficiency in communicating mathematical ideas in their proper language and methods.
  7. Solve problems by identifying what information is available and relevant to the problem.
  8. Solve problems by selecting or developing appropriate procedures and relationships.
  9. Solve problems by correctly applying the methods selected to the information available.

 

MAT 132 Course Outline

WEEK TOPIC SECTION
1 Logic and Proofs 1.1, 1.2, 1.3
2 Logic and Proofs 1.4, 1.5
3     TEST 1  
Matrices Appendix A
4 The Language of Mathematics 2.1, 2.2, 2.3
5     TEST 2  
Algorithms 3.1, 3.2
Project  
6 Counting Methods 4.1, 4.2, 4.4
7 Counting Methods 4.5
    TEST 3  
8 Graph Theory 6.1, 6.2, 6.3
9 Graph Theory 6.5, 6.6, 6.7
10     TEST 4  
Trees 7.1, 7.2
11 Trees 7.3, 7.5, 7.5, 7.7
12     TEST 5  
Summation Notation; Network Models 8.1, 8.2
Project  
13 Boolean Algebra and Combinatorial Circuits 9.1, 9.2
14     TEST 6