MATH 13
Liberal Arts Mathematics
Spring '13Calendar
week # Tuesday Thursday 1 Chapter 1 Graphs and Euler Circuits 2.1 Hamiltonian Circuits, the Traveling Salesman Problem 2 2.2 Algorithms for Solving TSP
- brute force, sorted edges and kruskal algorithms HW1 and solns2.3: Planning and Scheduling
- Scheduling Tasks
- Critical-Path Schedules -
HW2 and solutions3 3 Planning and Scheduling
- Independent Tasks
- Bin Packing
- Resolving Conflicts Via Coloring4: Mixture Problems
- Finding Optimal Production Policy
HW3 and solutions
HW4 and solutions4 Review Review 5 Review Test 1 (Chapters 1, 2, 3, 4)
6 9.1 Majority Rule and Condorcet’s Method
9.2: Other Voting Systems for Three or More Candidates
9.3 Insurmountable Difficulties: Arrow's Impossibility Theorem
9.4 A Better Approach? Approval Voting HW5 and Solutions
10.1 Majority Rule and Condorcet's Method10.2 Other Voting Systems for Three or More Candidates
10.3 Impossibility
10.4 The Chair's Paradox
HW6 and Solutions7 11.1 The 3hapley-Shubik Power Index
11.2 The Banzhaf Power Index
11.3 Comparing Voting Systems
HW7 and Solns
12.1 Elections with Only Two Alternatives 12.2 Elections with Three or More Alternatives: Procedures and Problems
12.3 Insurmountable Difficulties: From Paradox to Impossibility
8 12.4 A Better Approach? Approval VotingReview Review 9 Review Test 2 (Chapters 9, 10, 11, 12) 10 The Digital Revolution
16.1 Check Digits
16.2 The Zip Code
HW816.3 Bar Codes
16.4 Encoding Personal Data11 17.1 Binary Codes
17.2 Encoding with Parity Check Sums
17.3 Cryptography
17.4 Mathematical Logic and Web Searches ReviewReview 12 Test 3 (Chapters 16 and 17)
Optional Essay Assignment13 19.2 Symmetries Preserve the Pattern
19.3 Rosette, Strip and Wallpaper Patterns 19.4 Classifying Patterns
19.5 Symmetry Groups19.6 Fractals and Patterns20.1 Regular Polygons
20.2 Irregular Polygons14 20.3 Using Translation
20.4 Using Translations and Half Turns 20.5 Non Periodic Tilings20.6 The Penrose Tiles and Quasicrystals Review 15 Test 4 (Chapters 18, 19 and 20) Review 16 Final Exam