Math 2300, Spring 2013 Class
Schedule, Lecture Notes
Note: Schedule is subject to
change, please check frequently
WK |
Class/Date |
Topic
|
Book Chapter |
Assignments
|
Reading
|
1 |
M 1/28 |
Introduction and syllabus |
1 |
Syllabus, Chapter 1 | |
W 1/30 |
Logical Form and
Logical Equivalence |
1.1 |
HW1
Assigned |
||
F 2/1 |
Logical Form and Logical Equivalence | 1.1 |
|||
2 |
M 2/4 |
Conditional Statements | 1.2 |
HW1 Due, HW2 Assigned | |
W 2/6 |
Valid and Invalid Arguments | 1.3 |
HW2 Due, HW3Assigned | ||
F 2/8 |
Claude
Shannon - Father of the Information Age |
1.4 |
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, February 11th. |
http://www.youtube.com/watch?v=z2Whj_nL-x8 |
|
3 |
M 2/11 |
Digital Logic Circuits, Predicates | 1.4 2.1 |
HW3 Due, HW4 Assigned | Chapter 2 |
W 2/13 |
Predicates and Quantified Statements | 2.1,
2.2 |
HW5 Assigned | ||
F 2/15 |
Statements with Multiple Quantifiers | 2.3 |
HW4 Due, HW6 Assigned | ||
4 |
M
2/18 |
Arguments with Quantified Statements |
2.4 |
HW5 Due, HW7 Assigned | Chapter 3 |
W 2/20 |
Direct Proof and Counterexample | 3.1 |
HW6 Due, HW8 Assigned | ||
F 2/22 |
Direct Proof and Counterexample | 3.1 | HW7 Due | ||
5 |
M 2/25 |
Direct Proof and Counterexample | 3.2, 3.3 |
HW8 Due, HW9 Assigned | |
W 2/27 |
Direct Proof and Counterexample | 3.4, 3.5 | |||
F 3/1 |
Direct Proof and Counterexample | 3.4, 3.5 | HW9 Due | ||
6 |
M 3/4 |
Direct Proof and Counterexample Contradiction and Contrapositive |
3.5, 3.6 | HW10 Assigned | Chapter 4 |
W 3/6 |
Review for Quiz 1 Sequences |
4.1 |
HW11 Assigned | ||
F 3/8 |
Sequences |
4.1 |
HW10 Due | ||
7 |
M
3/11 |
PMI |
4.2 |
HW11 Due | |
W 3/13 |
Quiz 1 |
1,2,3.1-4 |
|||
F 3/15 |
PMI |
4.2 |
HW12 Assigned | ||
8 |
M 3/18 |
PMI |
4.3 | HW12 Due, HW13 Assigned | |
W 3/20 |
PMI and Strong PMI | 4.3, 4.4 |
Chapter 8 | ||
F 3/22 |
Quiz 1 and Recursion | 8.1 |
HW13 Due, HW14 Assigned | ||
|
|
Recursion |
8.1 |
HW14 Due |
Homework Extra Credit: Towers of Hanoi program to estimate time (in years) to move 64 disks (must be recursive) Assume 31,557,600 seconds per year Due April 10th |
W 3/27 |
Solving Recurrence Relations by Iteration | 8.2 |
HW15 Assigned | ||
F 3/29 |
Solving Recurrence Relations by Iteration | 8.2 |
Quiz 1 Optional Part 2 Due HW15 Due, HW16 Assigned |
||
Spring Break April 1-5 | |||||
10 |
|
Second-Order Linear Homogenous Recurrence Relations with Constant Coefficients | 8.3 |
HW16 Due, HW17 Assigned |
|
W 4/10 |
Solving Recurrences |
Handout |
HW18 Assigned | Towers of
Hanoi Extra Credit Due Upload to: https://hopper.csustan.edu/cshomework/ |
|
F 4/12 |
Solving Recurrences | Handout |
HW17 Due | Master
Theorem annimation |
|
11 |
|
Structural Induction | 8.4 |
HW18 Due, HW19 Assigned | |
W 4/17 |
Structural Induction Sets |
8.4 5.1 |
HW20 Assigned |
||
F 4/19 |
Sets |
5.1, 5.2 |
HW19 Due, HW21 Assigned | ||
12 |
|
Review for Quiz |
4, 8, Handout |
HW20 Due | |
W 4/24 |
Sets |
5.2, 5.3 |
HW22 Assigned | ||
F 4/26 |
Sets |
5.3 |
HW21 Due | ||
13 |
M
4/29 |
Quiz 2 |
4, 8, Handout | ||
W 5/1 |
Relations |
5.1 |
HW22 Due, HW23 Assigned | ||
F
5/3 |
Relations |
5.2 |
HW24 Assigned | ||
14 | M
5/6 |
Relations |
5.3 |
HW23 Due | |
W 5/8 |
Go Over Quiz 2 |
4, 8, Handout | |||
F
5/10 |
Pigeon Hole Principle | 7.3 |
HW24 Due, HW25 Assigned | ||
15 |
M
5/13 |
Graphs |
11 |
||
W 5/15 |
Review |
All |
HW25 Due |
Material covered since Quiz
2 |
|
F 5/17 | Graphs |
11 |
|||
|
Monday 5/20 |
|
Anmesty Homework Due (See announcements) |