genbar.gif - 8.9 K

Schedule for Fall 98, 1:30-2:45, Problem Solving

Mon Tue Wed Thu Fri
August 24



25
What is a problem?
Schoenfeld's model
26



27
Chapter 3
Introduction
28



September 31



1
Chapter 3
Scheduling Tasks
2



3
Chapter 2
Critical-Path Analysis
Chapter 3
Critical-Path Scheduling
4



7
Labor
Day
Recess
8
Chapter 3
Critical-Path Scheduling
9



10
Chapter 3
Bin Packing
11



14 15
Chapter 1
Street Networks
Euler Circuits
16



17
Chapter 1
Eulerizations
18
21



22
Chapter 2
Visiting Vertices
Hamiltonian Circuits
TSP
23



24
Chapter 2
Spanning Trees
Review
25



October 28



29
TEST 1
30



1
Chapter 11
Social Choice
2



5



6
Chapter 11
Voting Methods
7



8
Chapter 14
Apportionment
9



12



13
Chapter 14
Hamilton's Method
14



15
Chapter 14
Divisor Methods
16
Fall Break
19



20
Chapter 12
Weighted Voting Systems
21



22
Chapter 12
Counting carefully
23



26



27
Chapter 12
Power indices
28



29
TEST 2
30



November 2



3
Chapter 13
Fair Division
4



5
Chapter 13
Who gets what?
6



9



10
Chapter 9
Coding Information
Check digits
11



12
Chapter 9
Bar Codes
13



16 17
Chapter 10
Transmitting Information
18



19
Chapter 10
Binary Codes
20



23 24
TEST 3
25


26
Thanksgiving Break
27


December 30 1
Chapter 10
Cryptography
2



3
Chapter 17
Geometric growth
Loan Repayment
4



7



8
Chapter 17
Environmental Concerns
9



10
Review
11



14



15
Final Exam
3:30-5:30
16 17 18



Back to Math - 2.9 K Back to PLNC - 2.8 K
Last modified on August 27, 1998
Send comments and suggestions to GregCrow@ptloma.edu