PLNC Banner

TTh 1:35-2:50 Problem Solving -- Spring 1997

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