Math 2300, Spring 2015 Class
Schedule, Lecture Notes
Note: Schedule is subject to
change, please check frequently
WK 
Class/Date 
Topic 
Book Chapter 
Assignments 
Reading 
1 
W 1/28 
Introduction and syllabus  1 
Syllabus, Chapter 1  
F 1/30 
Logical Form and Logical Equivalence  1.1 
HW1 Assigned  
2 
M 2/2 
Logical Form and Logical Equivalence  1.1 


W 2/4 
Conditional Statements  1.2 
HW1 Due, HW2 Assigned  
F 2/6 
Valid and Invalid Arguments  1.3 
HW2 Due, HW3 Assigned  
3 
M 2/9 
Digital Logic Circuits  1.3 and 1.4 
HW4 Assigned  Chapter 2 
W 2/11 
Predicates and Quantified Statements  2.1 
HW3 Due, HW5 Assigned  
F 2/13 
Predicates and Quantified Statements  2.2 
HW4 Due, HW6 Assigned  
4 
M
2/16 
Statements with Multiple Quantifiers  2.3 
HW5 Due, HW7 Assigned  
W 2/18 
Arguments with Quantified Statements  2.4 
HW6 Due, HW8 Assigned  Chapter 3 

F 2/20 
Direct Proof and Counterexample  3.1 
HW7 Due, HW9 Assigned  
5 
M
2/23 
Direct Proof and Counterexample  3.2 
HW8 Due, HW10 Assigned  
W 2/25 
Direct Proof and Counterexample  3.3 
HW9 Due, HW11 Assigned  
F 2/27 
Claude Shannon  Father of the Information Age 
Watch video and answer: 1. What is the difference between a Shannon bit and a Tukey bit? 2. Who wrote "Beat the Dealer"? Turn in your answers on Monday, March 2. 
http://www.youtube.com/watch?v=z2Whj_nLx8  
6 
M 3/2 
Direct Proof and Counterexample  3.4 
HW10 Due  
W 3/4 
Direct Proof and Counterexample  3.4,
3.5 

F 3/6 
Review 
HW11 Due 

7 
M 3/9 
Floors and Ceilings and Review 
3.5  HW12 Assigned  
W 3/11 
Quiz 1 
1, 2, 3
(through 3.4) 

F 3/13 
Contradiction and Contrapositive  3.6 
Chapter
4 

8 
M 3/16 
Sequences  4.1 
HW12 Due, HW13 Assigned  
W 3/18 
PMI 
4.2 
HW13 Due, HW14 Assigned  
F 3/20 
PMI 
4.2, 4.3 
HW15 Assigned  
9 
M 3/23 
PMI 
4.3 
HW14 Due  Chapter 8 
W 3/25 
Strong PMI and Recursion  4.4, 8.1 
HW15 Due, HW16 Assigned  
F 3/27 
Solving Recurrence Relations by Iteration  8.1, 8.2 
Homework Extra Credit: Towers of Hanoi program (must be recursive) to estimate time (in years) to move 64 disks (one move per second). Assume 31,557,600 seconds per year. Turn in print out with your program and an example of it running (e.g. show command line and results). Due April 13th 

10 
M 3/30 
Solving Recurrence Relations by Iteration  8.1, 8.2 
HW16 Due, HW17 Assigned  
W 4/1 
Solving Recurrence Relations by Iteration  8.2 

F 4/3 
SecondOrder Linear Homogenous Recurrence Relations with Constant Coefficients  8.3 
HW17 Due, HW18 Assigned  Handout 

Spring Break, April
610 



Solving Recurrences  8.3 
HW18 Due, HW19 Assigned  
W 4/15 
Solving Recurrences  Handout 
HW19 Due, HW20 Assigned  
F 4/17 
Solving Recurrences  Handout 

12 

Structual Induction  8.4 

W 4/22 
Quiz
2 
4, 8 
Review for Quiz 2 

F 4/24 
Sets  5.1 
HW21 Assigned  Chapter
5 Master Theorem 

13 

Sets  5.2 
HW20 Due, HW22 Assigned  
W 4/29 
Sets  5.2 
HW21 Due, HW23 Assigned  
F 5/1 
Sets 
5.3 
HW22 Due  
14 

Relations  10.1 
HW23 Due, HW24 Assigned  
W 5/6 
Relations  10.2 
HW25 Assigned  
F 5/8 
Relations  10.3 
HW24 Due  
15 

Pigeon Hole Principle  7.3 
HW25 Due, HW26 Assigned  Review for material
since Quiz 2 
W 5/13 
Graphs 
11 
HW26 Due  
F 5/15 
Review 
all 


Monday 5/18 
FINAL EXAM 
