Discrete Mathematics, Schedule

Below is an approximate schedule for Discrete Mathematics (Math 231). These dates are subject to change. Exam dates will be confirmed two weeks prior to the exam.

DateSec (7th/8th Edition)Topic(6th Edition) Homework/Webwork due
LOGIC, PROOF TECHNIQUES, SETS, FUNCTIONS (EXAM I)
1/20/211.1 Propositional Logic (1.1)
1.3 Propositional Equivalences (1.2)
1/22/211.4 Predicates and Quantifiers (1.3)
1.5 Nested Quantifiers (1.4)
1/25/211.7 Introduction to Proofs (1.6)
1/27/21 Webwork (1.1/1.3)
1/29/211.8 Proof Methods and Strategy (1.7)
2/01/212.1 Sets (2.1)
2/03/212.2 Set Operations (2.2)Webwork (1.4/1.5)
2/05/212.3 Functions (2.3)
2/07/21
2/10/212.4 Sequences and Summations (2.4)Webwork (2.1/2.2), Homework 1
2/12/21
EXAM I
2/20/21No class: President's Day
INTEGERS, INDUCTION, SEQUENCES/SUMMATIONS (EXAM II)
2/17/214.1 The Integers and Division (3.4)
2/19/214.2 Integers and Algorithms (3.6)
2/22/214.3 Primes and Greatest Common Divisors (3.5)
2/24/214.4 Applications of Number Theory (3.7)Webwork (2.3/2.4), Webwork (4.1/4.2)
2/26/215.1 Mathematical Induction (4.1)
3/01/21
5.2 Strong Induction and Well-Ordering (4.2)
3/03/216.1 The Basics of Counting (5.1)Webwork (4.3/4.4)
3/05/21
EXAM II
COUNTING, BINOMIAL THEOREM, RECURRENCE RELATIONS (EXAM III)
3/08/216.2 The Pigeonhole Principle (5.2)
3/10/216.3 Permutations and Combinations (5.3)Homework 2
3/12/21 No Class: Mid-semester Reading Day
3/15/216.4 Binomial Coefficients (5.4)
3/17/21Webwork (6.1/6.2)
3/19/216.5 Generalized Permutations and Combinations (5.5)
3/22/215.3 Recursive Definitions and Structural Induction (4.3)
3/24/218.1 Recurrence Relations (7.1)Webwork (6.3/6.4), Webwork (6.5)
3/26/218.2 Solving Recurrence Relations (7.2)
3/29/2110.1 Graphs and Graph Models (9.1)
3/31/21
EXAM III
Webwork (5.3/8.1/8.2), Homework 3
GRAPH THEORY AND RELATIONS (EXAM IV)
4/02/21 No Class: Easter Break
4/05/21
4/07/2110.2 Graph Terminology and Special Types of Graphs (9.2)
4/09/2110.3 Representing Graphs and Graph Isomorphism (9.3)
4/12/2110.4 Connectivity (9.4)
4/14/2110.5 Euler and Hamilton Paths (9.5)Webwork (10)
4/16/2110.7 Planar Graphs (9.7)
4/19/2110.8 Graph Coloring (9.8)
4/21/2111.1 Introduction to Trees (10.1)Webwork (10 B)
11.4 Spanning Trees (10.4)
11.5 Minimum Spanning Trees (10.5)
4/23/219.1 Relations and Their Properties (8.1)
9.3 Representing Relations (Graphically and with Adjacency Matrices) (8.3)
4/26/219.5 Equivalence Relations (8.5)
4/28/21Webwork (Ch 11/9), Homework 4
4/30/21
EXAM IV
5/6/21
FINAL EXAM