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