Syllabus for Discrete Mathematics (sm342), Spring 2002-2003

Text: Discrete and combinatorial mathematics, 4th ed., by R. Grimaldi, Published by Addison-Wesley, 1999.

Lecture
Date
Section, Topic
Exercises
1. W Jan 8 1.1 Counting principles p. 12: # 1, 3, 11, 28
2. F Jan 10 1.2 Permutations p. 12: # 8, 9, 10, 12, 21, 27
3. M Jan 13 1.3 Combinations p. 25: # 1, 6, 7, 8, 13, 17, 25, 30, 32
4. W Jan 15 1.4 Combinations p. 34: # 1, 7, 13, 19, 21
5. F Jan 17 Quiz or review
  M Jan 20 MLK Day no class
6. W Jan 22 4.1 Induction, I p. 176: #1, 2, 8
7. F Jan 24 4.1 Induction, II p. 176: # 9, 10 11
8. M Jan 27 5.5 Pigeonhole principle p. 248: #1, 2, 10, 11
9. W Jan 29 8.1 Inclusion-exclusion p. 369: # 1, 3, 5, 11, 12, 17
10. F Jan 31 8.3 Derangements p. 375: # 1, 2, 3, 4
11. M Feb 3 8.4, 8.5 Rook polynomials p. 375: 2, 3, 4, 5a#
12. W Feb 5 Review
13. F Feb 7 TEST 1
14. M Feb 10 9.1 Generating functions, I p. 389, # 1, 2, 3, 4
15. W Feb 12 9.2 Generating functions, II p. 398, # 1, 2, 4, 9, 10
16. F Feb 14 9.3 Partition function p. 403, # 1, 2, 4
M Feb 17 Presidents Day no class
17. W Feb 19 10.1 First order recurrence relations p. 423, # 1, 2, 3, 4, 5, 6, 9
18. F Feb 21 Quiz or review
19. M Feb 24 10.2 Second order recurrence relations p. 432, #1, 2b, 3, 4, 5, 6
20. W Feb 26 10.3 Nonhomogeneous recurrence relations p. 444, #1, 2, 3a, 4
21. F Feb 28 10.4 Recurrence relations and generating functions p. 450, # 1, 2, 3
22. M Mar 3 10.5 Trees and recurrence relations p. 457, # 1, 2, 3, 4, 5, 6
23. W Mar 5 Review
24. F Mar 7 TEST 2
Spring break
25. M Mar 17 10.6 Recurrence relations and algorithmic complexity p. 468, # 1, 2, 3, 5a
26. W Mar 19 11.1 Graph theory - examples p. 483: # 2, 3, 4, 5, 6
27. F Mar 21 11.2 Graph isomorphism p. 493, # 1, 2, 3
28. M Mar 24 11.3 Euler circuits p. 503, # 1, 2, 3, 4a, 5
29. W Mar 26 11.4 Planar graphs p. 519, # 2, 3, 4, 5
30. F Mar 28 11.5 Hamiltonian cycles p. 529: # 1, 3, 4, 5
31. M Mar 31 12.1 Trees - examples p. 551: # 1, 2, 3, 14
32. W Apr 2 16.1 Groups - examples p. 707, # 1
33. F Apr 4 16.1 Groups - examples p. 707, # 11a, 17b
34. M Apr 7 16.4 Coding theory - introduction p. 719: # 1, 2, 3, 4
35. W Apr 9 16.5 Hamming metric p. 726: # 4, 5
36. F Apr 11 Quiz or review
36. M Apr 14 16.6 Parity check and generator matrices p. 726: # 1, 2, 3, 6, 7, 8
37. W Apr 16 16.7 Decoding with coset leaders p. 733: # 2, 3, 4
38. F Apr 18 Review
39. M Apr 21 16.10 Burnside's theorem p. 739: # 1, 2, 3a, 4, 7
41. W Apr 23 Review
42. F Apr 25 TEST 3
43. M Apr 28 Review


Last updated on 12-25-2002
by wdj