CRN: 3306 Course Information Sheet Spring 2008
MTH 220 Section 201
Discrete Structures
MW 6:30 – 7:45 P.M. SH 511
I. General Information
Instructor: Dr. Yulia Dementieva Office hours: MWF 10:00 – 12:00 A.M.
Office: ML 109 MW 5:00 – 6:00 P.M.
Office phone/e-mail: 696-6643 / dementieva@marshall.edu
Web Page: http://webpages.marshall.edu/~dementieva/
Text: Discrete Mathematical Structures by Kolman, Busby, and Ross (Fifth Edition)
Prerequisites: ACT 27 or SAT 610 or MTH 132 or MTH 127 or MTH 130 or IST 131 or MTH 229
or MTH 122
Calculator Requirements: A scientific calculator of any kind is required.
Course Description: Discrete Mathematics is the mathematics of finite sets. You will be introduced
to many new concepts and topics. Briefly, the topics covered in the course include: logic, set
theory, functions, algorithms, relations, inductive and recursive definitions and arguments,
fundamentals of counting and discrete probability, recurrence relations, elementary graph theory
including trees, tree searching, graph coloring, etc. While there are many new concepts and
topics, there are many connections between them. Because computers work with finite sets much
of what we do will have applications to computer science.
Course Objectives: This course has more than one purpose. Students should learn a particular set of
mathematical facts and how to apply them; more importantly, the course teaches students how to
think mathematically.
II. Attendance Policy
You are expected to attend class and participate. There is no attendance grade, though.
However, missing class can be expected to significantly reduce your chances of success.
III. Testing and Grading
A. The following grades will be taken:
Quizzes 20%
Test 1 25%
Test 2 25%
Final Exam 30% 6:30 P.M. – 7:45 P.M. Monday, May 5
TOTAL 100%
B. Homework problems will be assigned at each class meeting. These problems are for you benefit
and will not be graded. However, some of the homework problems will appear on quizzes.
C. There will be a series of short (10-15 minutes) announced quizzes given roughly once each
week. These quizzes are closed notes and books. However the use of a calculator will be
allowed. The two lowest quiz grades will be dropped before calculating the quiz average. No
make-up for quizzes will be given.
D. There will be two midterms, and a cumulative final exam. All exams will be in-class and closed
book; however, you may bring one 5 inches by 8 inches card with formulas on it. You may also
use your calculator during the exams. The tentative dates for the midterms are Monday,
February 25 and Wednesday, April 16. Final exam will be on Monday, May 5 from 6:30 pm
to 7:45 pm.
E. The semester grade will be based on the following scale.
90 -100% -- A
80 - 89% -- B
70 - 79% -- C
60 - 69% -- D
0 - 59% -- F
IV. Missing Exams
A. If you miss a test due to an unexcused absence, you will receive a grade of 0 for that test.
B. If you miss a test due to an excused absence, you must provide verification within one week of
the test. You will then be allowed to take the make-up test.
C. If you cannot be at the final exam, let me know as soon as you know. A missing final exam
score means an automatic grade of F for the course.
V. Cheating
A. In a case of suspicion, a student may be asked to re-take the test.
B. Confirmed cheating will result in a grade of 0 on the test.
VI. Miscellaneous
A. Free tutoring is available in SH 526 and through Academic Support Services (696-3169). Free
tutoring is also available for veterans.
B. DATES TO REMEMBER: Midterm grade reports for freshmen will be turned in on Monday,
March 10.
The last day to drop this class is Friday, March 21. (All drops will be recorded as a grade of W.)
MTH 220: Discrete Structures Spring 2008
Text: Discrete Mathematical Structures by Kolman, Bursby, and Ross (Fifth Edition)
Schedule of Topics
1-14 Introduction 3-10 4.6 Computer Representation of
1.1 Sets and Subsets Relations
1.2 Operations on Sets
3-12 5.1 Functions
1-16 1.2 The Addition Principle 5.2 Functions for Computer Science
1.3 Sequences
1-21 MLK Day 3-17 5.3 Growth of Functions
1-23 1.4 Division and Integers 3-19 7.1 Trees
1-28 1.5 Matrices 3-24 Spring Break
1-30 2.1 Propositions and Logical Operations 3-26 Spring Break
2-4 2.2 Conditional Statements 3-31 7.2 Labeled Trees
2-6 2.3 Methods of Proof 4-2 7.3 Tree Searching
2-11 3.1 Counting Rules: Permutations 4-7 7.4 Undirected Trees
3.2 Combinations 7.5 Minimal Spanning Tree
2-13 3.3 Pigeonhole Principle 4-9 Assessment Day
2-18 3.5 Recurrence Relations 4-14 Review for Test 2
2-20 Review for Test 1 4-16 TEST 2
2-25 TEST 1 4-21 8.1 Graphs
2-27 4.1 Product Sets and Partitions 4-23 8.2 Euler Paths and Circuits
4.2 Relations and Digraphs 8.3 Hamiltonian Paths and Circuits
3-3 4.4 Properties of Relations 4-28 8.5 Matching Problems
8.4 Maximum Flow Algorithm
8.6 Coloring Graphs
3-5 4.5 Equivalence Relations
4-30 Review (Last Class)