| Month | Mon | Tue | Wed | Thu | Fri |
|---|---|---|---|---|---|
| August | 21
| 22
| 23
| 24
What is a problem? Schoenfeld's model Practice problems | 25
|
| 28
| 29
Classifying problems Chapter 1 Street Networks Euler Circuits | 30
| 31
Chapter 1 Eulerizations | 1
| |
| September | 4 Labor Day Recess | 5
Chapter 2 Visiting Vertices Hamiltonian Circuits TSP | 6
| 7
Chapter 2 Spanning Trees Critical-Path Analysis | 8
|
| 11
| 12
Chapter 3 Introduction | 13
| 14
Chapter 3 Scheduling Tasks | 15
| |
| 18
| 19
Chapter 3 Critical-Path Scheduling | 20
| 21
Chapter 3 Bin Packing | 22
| |
| 25
| 26
Chapter 11 Social Choice | 27
| 28
TEST 1 | 29
| |
| October | 2
| 3
Chapter 11 Voting Methods | 4
| 5
Chapter 14 Apportionment | 6
|
| 9 | 10
Chapter 14 Hamilton's Method | 11
| 12
Chapter 14 Divisor Methods | 13 Fall Break | |
| 16 | 17
Chapter 12 Weighted Voting Systems | 18
| 19
TEST 2 | 20
| |
| 23
| 24
Chapter 12 Counting carefully | 25
| 26
Chapter 12 Power indices | 27
| |
| 30 | 31
Chapter 13 Fair Division | 1
| 2
Chapter 13 Who gets what? | 3
| |
| November | 6 | 7
Chapter 9 Coding Information Check digits | 8
| 9
Chapter 9 Bar Codes | 10
|
| 13 | 14
Test 3 | 15
| 16
Chapter 10 Transmitting Information | 17
| |
| 20 | 21
Chapter 10 Binary Codes | 22
| 23
Thanksgiving | 24
Break | |
| 27
| 28
Chapter 10 Cryptography | 29
| 30
Chapter 17 Geometric growth Loan Repayment | 1
| |
| December | 4 | 5
Chapter 17 Environmental Concerns | 6
| 7
Review | 8
|
| 11
| 12
Final Exam 3:00 PM | 13
| 14
| 15
| |