PLNC Banner

TTh 1:35-2:50 Problem Solving -- Fall 1996

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