Class Date
Topics Covered
Homework Assignment
Week
1
Wednesday,
January 21
Course
Introduction; Syllabus Review
Section 1.3: Introduction to Logic
(Deductive Reasoning and Inductive Reasoning)
None
Friday,
January 23
Section
1.3: Symbolic Logic
pg.
38: 5-9 (a-c for each problem)
Week
2
Monday,
January 26
Section
1.3: Truth Tables
(Conjunctions and Disjunctions)
pg.
38-39: 11(a-e), 14, 15,16, 17
Wednesday,
January 28
Section
1.3: DeMorgan's Law,
Logically Equivalent Statements
Handout
Given in Class
(Click HERE to Access Handout)
Friday,
January 30
Section
1.5: Implications (The Conditional)
pg.
65-67: 4, 7, 20
Week
3
Monday,
February 2
Section
1.5: Implications (Continued) Converse, Inverse and Contrapositive
26 (a, c), 27 (a, c)
Wednesday,
February 4
Section
1.6: Validity of Arguments
pg.
76: 1, 2, 6, 9 (a)
Friday,
February 6
Section
1.6: Validity of Arguments (Continued)
Handout
Given in Class
(Click HERE to Access Handout)
Week
4
Monday,
February 9
Wednesday,
February 11
Section
1.4: Predicates and Quantifiers
pg.
51-52: 5, 7, 8
Friday,
February 13
Section 1.4: Quantifiers and Venn Diagrams
Begin Review for Test #1
Handout
Given in Class
(Click HERE to
Access Handout)
Practice
Test #1 Problems Here
(Click HERE to Access Handout)
Monday,
February 16
Wednesday,
February 18
Review for Test #1
Practice
Test #1 Problems Here
(Click HERE to Access Handout)
Friday,
February 20
Class Canceled
Monday, February 23
Wednesday, February 25
Return
Test #1
Section 3.1: Introduction to Sets and Set Notation
Review
Test #1
Friday,
February 27
Section
3.1: Introduction to Sets and Set Notation
(Set Builder Notation, Unions, and Intersections)
pg.
193-195: 1, 4, 5, 6, 8, 12(a, c)
Monday,
March 2
Section
3.1: Cardinality of Sets and Venn Diagrams
Handout
Given in Class
(Click HERE to Access
Handout)
Wednesday,
March 4
Section
2.1: Introduction to Proofs
pg.
96: 1 (a, c, e, g), 2 (a-d), 5 (a, b)
Prove: "If n is even,
then n squared is divisible by 4."
Friday,
March 6
Education Discussion
None
Monday,
March 16
Section
2.1: Introduction to Proofs (Con't)
pg.
97: 9 (a-c)
Wednesday,
March 18
Section
2.2: Indirect Proofs and Proving by Cases
Prove each statement:
1. If 
is even, then n is even. (HINT: Use an indirect proof).
2. For any integer n, 
is even.
Friday,
March 20
Section
2.2: Proving by Cases and Mod Notation
See RU email for Proofs to be done for next week.
See RU email for Proofs
(Numbers, Indirect Proof, and Proofs by Cases)
Review of Proofs from Week 9
(Numbers, Indirect Proof, and Proofs by Cases)
Section
2.3: Introduction to Proofs by Induction
Wednesday,
April 1
Section
2.3:
Handout
Given in Class
(Click HERE to Access
Handout)
Friday,
April 3
Review
for Test #2 (Sets)
Practice
Test #2 Problems Here
(Click HERE to Access
Handout)
Practice Test #2 Proofs Handout from Class
Monday, April 6
Sets Theory and Proofs
Wednesday,
April 8
Section
7.1: Graph Theory
(Euler Graphs, Euler Paths, Hamilton Circuits, and Spanning Trees)
Review Test #2
Friday,
April 10
Section 7.2: Graph Theory (Con’t): Hamilton Circuits, Spanning Trees, Minimum Spanning Trees
(Click HERE to Access
Handout)
Monday,
April 13
Section
5.2: The Counting Principle
pg.
395: 1, 2 (a, c), 3, 9, 11
Wednesday,
April 15
Section
6.1: Basic Probability
Pg.
446-447: 1 (a,c), 2 (a), 3 (a,c),
4 (a), 7 (a, c, e)
Friday,
April 17
Section 5.2: Permutations
Monday,
April 20
Section 5.2: Combinations
(Click HERE to Access
Handout)
Wednesday,
April 22
Review for Test #3
Friday, April 24
Test #3
Monday,
April 27
Return Test #3
Begin Review for Final Exam
(Review of Tests 1 and 3)
Wednesday,
April 29
Finish Review for Final Exam
(Review of Test #2)
Friday,
May 1
Office Hours (9am-noon) Walker Hall 210
Final Exam
Monday, May 2
(12:30pm-2:30pm)