PLNC Banner

WF 10:45-12:00 Problem Solving -- Spring 1997

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