Discrete Math Info
MATH 510
16501 Chris Pinner
General Information
Homeworks
HW1. 1.8 14,17,18,26,27.
(Due Friday Aug 29). HW Questions
HW2. 2.4 5,7,9,10,16,17,19b.
(Due Friday Sep 5). 2.4. Q5
2.4. Q7-Q19b
HW3. 2.4 20,22
(first part). 3.6 1,4b,5b,13. (Due Friday Sep 12). Extra
Credit Problem: 2.4 23.
HW4. 3.6 8,11,19,21,22,24.
(Due Friday Sep 19).
HW5. 3.6 18,26,30,31,35,38.
5.8 2. (Due Friday Sep 26).
HW6. 5.8 5,8,10,11,12,18,20.
(Due Friday Oct 3).
HW7. 5.8 25,34,35,37,38.
(Due Friday Oct 10).
HW8. 5.8 40,42. 6.6 2,5,6,9.
(Due Friday Oct 17).
HW9. 6.6 13,14,16,21,24ac.
(Due Friday Oct 24).
HW10. 6.6 27,29. 7.8 1d,2,3c,6.
(Due Friday Oct 31).
HW11. 7.8 7,11,12,14,15b,21.
(Due Friday Nov 7).
HW12. 7.8 23b,24bd,25cd,27,30.
(Due Friday Nov 14).
HW13. 11.8 2,4,5,6,9,12.
(Due Friday Nov 21).
HW14. 11.8 13,15,29,30,35,37,39.
(Due Wednesday Dec 3). Extra Credit 11.8 20.
HW15. 11.8 54,56,62. 9.5
1,2,10,11,26 (Due Wed Dec 10).
Exams
Exam 1 is now scheduled for Wednesday October 1.
Exam 2 is currently planned for Wednesday November
12.
Final Exam Wednesday December 17, 4:10-6:00pm,
LS112.
Spring
2003 Exam 1 (Solutions)
Fall
2003 Exam 1 Solutions: pg1 pg2 pg3
Actual exam will probably have more parts but will cover similar
material.
The exam will be based on examples covered in class or from
the homework.
Spring
2003 Exam 2 (we have not yet covered question 5).
Fall
2003 Exam 2 Solutions: pg1 pg2 pg3
pg4
Actual exam will have about ten questions and covers:
Ch5: Multinomial theorem, combinatorial proofs.
Ch6: Inclusion-exclusion principle, combinations with repetitions,
derangements, permutations with forbidden positions.
Ch7: Recurrence relations, solving linear recurrences, generating
functions, recurrences and generating functions.
Spring
2003 Final Exam
Fall
2003 Final Exam Solutions: pg1 pg2 pg3
pg4 pg5
Actual exam will have about 17 questions (5 pages) and will cover:
1. Pigeonhole principle, strong form pigeonhole
2. Combinations, permutations (including circular permutations).
3. Combinations of multisets.
4. Multinomial theorem.
5. Binomial theorem identities.
6. Inclusion-exclusion principle
7. Permutations with forbidden positions.
8. Generating functions
9. Recurrence relations, recurrences via generating functions.
10. Euler trails & basic graph theory.
11. Hamilton chains & basic graph theory.
12. Trees
13. Bipartite graphs & matchings
14. Stable marriages.
Course Curve & Grade Distribution
A
85-91 (7)
B 77-81 (5)
C 66-75 (11)
D 60-63 (2)
F 46-53 (4)
Average= 72
Median=73
