Math 2300, Spring 2019 Class
Schedule, Lecture Notes
Note: Schedule is subject to
change, please check frequently
|
WK |
Class/Date |
Topic |
Book
Chapter |
Assignments |
Reading |
| 1 |
F 1/25 |
Introduction and syllabus | 2 |
Syllabus, Chapter 2 | |
|
2 |
M 1/28 |
Logical Form and Logical Equivalence |
2.1 |
HW1 Assigned | 2.1
Handout |
|
W 1/30 |
Logical Form and Logical Equivalence | 2.1 |
|||
|
F 2/1 |
Logic: Conditional Statements | 2.2 |
HW1 Due HW2 Assigned |
||
|
3 |
M 2/4 |
Logic: Valid and Invalid Arguments | 2.3 |
HW3 Assigned | 2.3
Handout |
|
W 2/6 |
Logic: Digital Logic Circuits | 2.4 |
HW2
Due HW4 Assigned |
Chapter 3 |
|
|
F 2/8 |
Predicates and Quantified Statements I | 3.1 |
HW3 Due | 3.1 Handout |
|
4 |
M 2/11 |
Predicates and Quantified Statements II | 3.2 |
HW5 Assigned | 3.2 Handout |
| W 2/13 |
Statements with Multiple Quantifiers | 3.3 |
HW4 Due | 3.3 Handout |
|
| F 2/15 |
Arguments with Quantified Statements | 3.4 |
HW5 Due HW6 Assigned |
Chapter 4 3.4 Handout Review for Quiz 1 |
|
5 |
M
2/18 |
Direct Proof and Counterexample I: Introduction | 4.1 |
HW7 Assigned | 4.1
Handout |
| W 2/20 |
Direct Proof and Counterexample II: Rationals | 4.2 |
HW6 Due HW8 Assigned |
||
| F 2/22 |
Review for Quiz |
2, 3 |
HW7 Due | Review for Quiz 1 |
|
|
6 |
M 2/25 |
Direct Proof and Counterexample III: Divisibility | 4.3 |
||
|
W 2/27 |
Go over HW 6 |
3.3,
3.4 |
|||
|
F 3/1 |
Quiz 1 |
2, 3 |
|||
|
7 |
M 3/4 |
Direct Proof and Counterexample IV: Division into Cases | 4.4 | ||
|
W 3/6 |
Direct Proof and Counterexample V: Floor and Ceiling | 4.5 |
HW9 Assigned | ||
|
F 3/8 |
Indirect Argument | 4.6 |
HW8 Due | Chapter
5 |
|
|
8 |
M 3/11 |
Sequences | 5.1 |
||
|
W 3/13 |
Sequences |
5.1 |
HW9 Due HW10 Assigned |
||
|
F 3/16 |
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"? 3. What did you find most interesting? 4. What is you find most confusing or what do you want to learn more about? Turn in your answers (hard copy) on Monday, March 25th. |
https://www.youtube.com/watch?v=z2Whj_nL-x8 | ||
| Spring Break: March
18-22 |
|||||
|
9 |
M 3/25 |
Mathematical Induction | 5.2 |
Shannon Video Paper Due HW11 Assigned |
PMI
Handout |
|
W 3/27 |
Mathematical Induction | 5.3 |
HW10 Due |
||
|
F 3/29 |
Mathematical Induction | 5.3 |
HW11 Due Quiz 1, Optional Part 1 Due |
PSMI Handout |
|
|
10 |
M 4/1 |
Cesar Chavez Day - No Class | |||
|
W 4/3 |
Mathematical Induction | 5.4 |
HW12
Due HW13 Assigned |
||
|
F 4/5 |
Strong
Induction Examples |
5.4 |
|||
|
|
|
Defining Sequences Recursively | 5.6 |
HW14 Assigned HW13 Due |
Review for Quiz 2 |
|
W 4/10 |
Defining Sequences Recursively | 5.6 |
Homework Extra Credit 1 (20 pts): 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 26th Upload code and a README.txt file with your answer and how to run your code to the homework submission system |
||
|
F 4/12 |
Review for Quiz 2 |
HW14 Due |
|||
|
12 |
|
Solving Recurrence Relations by Iteration | 5.7 |
HW15 and 16 Assigned | |
|
W 4/17 |
Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients | 5.8 |
HW17 Assigned |
SOLHRRCC Handout |
|
|
F 4/19 |
Quiz 2 |
||||
|
13 |
|
Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients and Handout | 5.8 |
SOLRRCC
Handout More on Solving RRs |
|
|
W 4/24 |
Solving Recurrences |
Handout |
HW18 Assigned HW15 Due |
Formulas for Homework 16 |
|
|
F 4/26 |
Sets | 6.1 |
HW16 Due Towers of Hanoi EC Due Due date extended to May 15 |
||
|
14 |
|
Go over Quiz 2 |
HW17
Due For each video, write one paragraph on what you found most interesting and what you found most difficult to understand. Due May 15th. |
Homework Extra Credit 2 (20 pts): Watch the first 16 minutes of: Time Complexity of Iterative Algorithms Watch starting at 13:49: Recursion Tree Method for Solving Recurrences Homework Extra Credit 3 (20 pts): Make a plan for how you will pass this class. It should be in the form of an annotated timeline. |
|
|
W 5/1 |
Sets |
6.1 |
HW19 Assigned Extra Credit 3 due |
||
|
F 5/3 |
Sets | 6.2 |
HW20 Assigned HW18 Due |
||
|
15 |
|
Sets |
6.2, 6.3 |
HW21 Assigned HW19 Due |
|
|
W 5/8 |
Sets |
6.3, 6.4 |
HW20 Due | Homework
Extra Credit 4 (20 pts): List the 5 most important things you learned in this class. For each one write at least 2 sentences on why they are especially important or interesting. |
|
|
F 5/10 |
Pigeonhole
Principle |
9.4 |
HW21 Due | ||
| 16 |
M 5/13 |
||||
| W 5/15 |
Review for Final |
Extra Credit 1, 2, 4 Due |
|||
| |
Friday 5/17 |
FINAL EXAM |
|
Review for Final |