Math 231 Discrete Structures---Fall 2010
M W F 11:00-11:50 Paccar 105
Phone: 313-3901 (×3901 on campus) e-mail: overbay@gonzaga.edu
Office Hours: 2:00-3:00 Monday, Tuesday, and Wednesday (Herak 311A)
11:00-12:00 Tuesday in Math Lab (Herak 224).
Other times by appointment.
Text: Discrete Mathematics and Its Applications (5th or 6th edition) Kenneth Rosen
Grading System: During the course there will be four in-class examinations, each worth 100 points and a comprehensive final examination worth 200 points. There will be an additional 100 points of homework. Your grade will be based on points earned out of a possible 700.
B 560-629
C 490-559
D 420-489
F 0-419
Plusses or minuses may be attached to these grades at the discretion of the instructor.
Makeup Examinations: Exams must be taken at the normally scheduled time if at all possible. If an exam must be missed due to an athletic or other school event, arrangements should be made at least one week in advance of the normally scheduled exam date. Late makeup exams are only given in case of a documented emergency.
Homework: Assigned homework has the following three purposes: (1) To specify the material students will be responsible for, (2) To provide relevant examples for class discussions and, most importantly, (3) To provide material through which the student can enhance their knowledge of the subject. Selected even-numbered homework problems will be assigned and collected during class on specified dates. Additional odd-numbered problems will be assigned for practice, but will not be handed in.
Disabled Student Services: Anyone requiring special accommodations for a documented disability should make arrangements through the DREAM office ×4134.
Academic Honesty: Academic Honesty should be maintained at all times. Any incidents of copying or cheating will result in a failing grade. Please refer to the student handbook for a description of the Academic Honesty policy.
Extra Credit: There will be no extra credit given in this course.
Cell Phones: Phones should be turned off during class and no texting during class!
Attendance: You are expected to attend class. Missing more than six class periods may result in a V grade or a lowering of the course grade by one or more letter grades.
*THIS SYLLABUS IS SUBJECT TO CHANGE*
Be sure to verify all exam and homework dates with instructor.
M 231 Tentative Course Schedule:
8-30-10 No Class 11-08-10 Review
9-01-10 1.1 11-10-10 Exam III
9-03-10 1.2 11-12-10 9.1/9.2
9-06-10 No Class 11-15-10 9.3
9-08-10 1.3 11-17-10 9.4/9.5
9-10-10 1.4 11-19-10 9.7/9.8
9-13-10 1.6 11-22-10 10.1
9-15-10 Mass of the HS 11-24-10 No Class
9-17-10 1.7 11-26-10 No Class
9-20-10 2.1 11-29-10 10.4/10.5
9-22-10 2.2 12-01-10 Review
9-24-10 Review 12-03-10 Exam IV
9-27-10 Exam I 12-06-10 8.1/8.3
9-29-10 2.3 12-08-10 8.5
10-01-10 2.4 12-10-10 Final Review
10-04-10 3.4
10-06-10 3.5 FINAL EXAM:
10-08-10 3.6/3.7 8:00-10:00 a.m.
Wednesday, Dec. 15
10-11-10 4.1
10-13-10 4.2
10-15-10 4.3
10-18-10 No Class
10-20-10 Review
10-22-10 Exam II
10-25-10 5.1
10-27-10 5.2/5.3
10-29-10 5.4/5.5
11-01-10 7.1
11-03-10 7.2
11-05-10 7.5/7.6
MATH 231 DISCRETE STRUCTURES TOPIC LIST (FALL 2010)
(Discrete Mathematics and Its Applications, Rosen, 6th edition)
I) LOGIC, PROOF TECHNIQUES, SETS (EXAM I)
1.1 Propositional Logic
1.2 Propositional Equivalences
1.3 Predicates and Quantifiers
1.4 Nested Quantifiers
1.6 Introduction to Proofs
1.7 Proof Methods and Strategy
2.1 Sets
2.2 Set Operations
II) INTEGERS, INDUCTION, FUNCTIONS, SEQUENCES AND SUMMATIONS (EXAM II)
2.3 Functions
2.4 Sequences and Summations
3.4 The Integers and Division
3.5 Primes and Greatest Common Divisors
3.6 Integers and Algorithms
3.7 Applications of Number Theory
4.1 Mathematical Induction
4.2 Strong Induction and Well-Ordering
4.3 Recursive Definitions and Structural Induction
III) COUNTING, BINOMIAL THEOREM, RECURRENCE RELATIONS (EXAM III)
5.1 The Basics of Counting
5.2 The Pigeonhole Principle
5.3 Permutations and Combinations
5.4 Binomial Coefficients
5.5 Generalized Permutations and Combinations
7.1 Recurrence Relations
7.2 Solving Recurrence Relations
7.5 Inclusions-Exclusion
7.6 Applications of Inclusion-Exclusion
IV) GRAPH THEORY (EXAM IV)
9.1 Graphs and Graph Models
9.2 Graph Terminology and Special Types of Graphs
9.3 Representing Graphs and Graph Isomorphism
9.4 Connectivity
9.5 Euler and Hamilton Paths
9.7 Planar Graphs
9.8 Graph Coloring
10.1 Introduction to Trees
10.4 Spanning Trees
10.5 Minimum Spanning Trees
V) RELATIONS AND DIRECTED GRAPH REPRESENTATIONS (PREP WEEK)
8.1 Relations and Their Properties
8.3 Representing Relations (Graphically and with Adjacency Matrices)
8.5 Equivalence Relations