Ognjen Milatovic

MGF 1107 - Explorations in Mathematics

Fall 2008

Homework Assignments


 
Reading Page Problems
1.1 - 1.2 Finding Euler Circuits 25 - 33 1, 3, 6, 7, 8, 24, 27, 28
1.3 - 1.4 Beyond Euler Circuits 25 - 33 31, 35, 37, 38
2.1 Hamiltonian Circuits 64 - 72 1, 8, 11, 22, 23, 25, 26, 27, 30
2.2 Traveling Salesman Problem 64 - 72 33, 34, 35, 40(a), 42, 44
2.3 Minimum Cost Spanning Trees 64 - 72 48, 49, 51 (a)(b), 53, 54, 55
2.4 Critical Path Analysis 64 - 72 68 (a), 69
Handout on Modular Arithmetic 1 - 3 all exercises
16.1 Check Digits 613 1, 7, 9, 31
16.2 Postnet Codes 616 47, 49
16.4 Encoding Personal Data 617 64, 70
17.1 Binary Codes 654 1, 2, 5
17.3 Cryptography 656 38, 40
9.1 Majority Rule and Condorcet's Method 364 1, 2, 3
9.2 Other Voting Systems for Three or More Candidates 364 - 368 9, 11, 13, 16, 18, 19, 20, 21
19.1 Fibonacci Numbers 543 4(a)
Definition of a Function handout 1
19.2 Symmetries Preserve the Pattern 746 19, 20, 21, 23, 25
19.3 Strip and Walpaper Patterns 746 33, 35, 36


Back to MGF 1107, Created: August 24, 2008.      
or back to my Home page.