Fall 2012 MAT202.01 MWF 10:30

MAT202 Discrete Structures

 Kevin J. CarlinOffice:  Fo 113 MWF 1:30-4:00 Telephone: 7563E-mail: kcarlin@assumption.edu

Required Text

Epp, Discrete Mathematics with Applications, fourth edition, Brooks/Cole, 2011.

Homework Journal

For your homework journal, you will need a ring binder and a supply of loose-leaf paper. The homework journal is intended to be a complete record of your work arranged by topic. Class notes must be kept separately. Homework revisions, practice problems, quiz and exam corrections, and any tutorial work with me or the mathematics tutors should all be included. None of your work should be erased, obliterated, or destroyed so that you will have a true record of your learning experience.

Calculator Policy

Calculators may not be used in this course.

Electronic Devices

An electronic communication device, such as a cell phone or lap-top computer, may not be used as a watch, as a calculator, or for any other purpose. They must be put away and completely deactivated during class.

Topics

Logic and Mathematical Proof: compound statements, logical equivalences, valid arguments, quantified statements, direct proof and counter-example, proof by contradiction, indirect proof.

Induction and Recursion: sequences and sums, mathematical induction, recursive definition, solution of recurrence relations.

Sets and Counting: sets, relations, functions, set identities, permutations and combinations, the binomial theorem.

Graphs and Trees: Euler paths and circuits, Hamiltonian circuits, spanning trees.

There will be four quizzes, two exams (October 11 and November 30), and a cumulative final exam. The homework journal will be collected for grading near the end of the semester. Your final grade will be based on 400 points:

 Quizzesand Homework Journal Best 4 @ 20 points 80 Exams 2 @ 100 points 200 Final Exam 1 @ 120 points 120 400

Grades are based on partial credit and will be scaled. Typically, the scale is A- = 75%, B- = 60%, C- = 50%, D- = 35%.

Make-up of any graded work due to serious illness or other emergency is possible only with prior or immediate notice and will be granted at my sole discretion.

Learning Objectives

• Students will understand the principles of mathematical logic and the techniques of mathematical proof. They will be able to apply these to read and construct proofs and to solve recurrences.

• Students will understand the language of sets and functions. They will know the various techniques used for counting. Students will understand the theory of graphs. They will be able to use these to solve a variety of problems.

Course Description

MAT 202 Discrete Structures
This course is an introduction to mathematical logic and discrete systems. Topics include Boolean algebra, mathematical proof, induction, sets, relations, functions, combinatorics, graph theory, and applications. Prerequisite: MAT 118 or MAT 132 must be completed or taken concurrently.