MTH 2350 -- Discrete Math -- Fall 2007 -- course schedule

last updated 12.5.2007
(check back frequently for updates)

date [class number] agenda practice homework
(M 8/27) [1] review syllabus, classweb
Section 1.1 = truth tables 		Section 1.1 = 1-11
(truth table practice here)
(W 8/29) [2] Section 1.1 continued
Section 1.2 = the algebra of propositions 		Section 1.2 = 1-10
(look for the "Analytical Engine Online" at the links page)
(F 8/31) [3] Section 1.2 continued
Section 1.3 = logical arguments 		Section 1.3 = ?!
(M 9/3) Labor Day
no classes
(W 9/5) [4] Section 2.1 = sets Section 2.1 = 1-14
(the Amazing Mathematical Object Factory is here)
(F 9/7) [5] Section 2.1 continued
Section 2.2 = operations on sets 		Section 2.2 = 1-30
(Venn links 1, 2, 3)
(M 9/10) [6] H1 due (see the file in Excel 2007 or pdf)
Section 2.2 continued 		 
(W 9/12) [7] Section 2.3 = binary relations Section 2.3 = ?!
(F 9/14) [8] Q1 = (1.1,1.2,2.1,2.2)  
(M 9/17) [9] Section 3.1 = mathematical induction Section 3.1 = 1-8,11,12
(W 9/19) [10] Section 3.1 continued
Section 3.2 = recursively defined sequences 		Section 3.2 = 1,2,6-10,12,15,18-21,40-43
(links for sequences: 1, 2, 3)
(F 9/21) [11] Section 3.2 continued
(M 9/24) [12] Section 4.1 = the principle of inclusion-exclusion
H2 now due Wednesday 9/26/7
Section 4.1 = 1-15
(W 9/26) [13] H2 due
Section 4.2 = the addition and multiplication rules 		Section 4.2 = 1-23
(F 9/28) [14] Section 4.3 = the pigeonhole principle
Q2 moved to Monday 10/1/7 		 
(M 10/1) [15] Section 4.3 continued
Q2 = (4.1,4.2,4.3) 		Section 4.3 = 1-19,27
(W 10/3) [16] Section 5.1 = permutations
Section 5.1 = 1-17
(the Amazing Mathematical Object Factory is here)
(F 10/5) [17] Section 5.2 = combinations Section 5.2 = 1-20,25
(the Amazing Mathematical Object Factory is here)
(M 10/8) Columbus Day
no classes
(W 10/10) [18] Section 5.5 = repetitions Section 5.5 = 1-19
(F 10/12) [19] Section 5.5 continued
Section 5.6 = derangements
Q3 moved to Friday 10/19/7 		Section 5.6 = 1-8
(M 10/15) [20] Section 5.6 continued
Section 5.7 = the binomial theorem
H3 due 		Section 5.7 = 1-12
(T 10/16) mid-semester Click this image to learn more!
(W 10/17) [21] Section 5.7 continued  
(F 10/19) [22] Q3 = (Chapter 5)
(M 10/22) [23] Section 6.1 = a gentle introduction to graphs Section 6.1 = 1-11
(W 10/24) [24] Section 6.2 = definitions and basic properties Section 6.2 = 1-9,12-23,27,28
(F 10/26) [25] Section 6.3 = isomorphism Section 6.3 = 1-11
(the NCTM Graph Creator is here)
(M 10/29) [26] Chapter 6 summary
(W 10/31) [27] Section 7.1 = Eulerian circuits Section 7.1 = 1-13,22-27
(F 11/2) [28] Section 7.1 continued
Section 7.2 = Hamilton circuits
Section 7.2 = 1-13,21-24
(M 11/5) [29] Section 7.3 = adjacency matrices
Section 7.4 = shortest path algorithms 		Section 7.3 = 1-14
Section 7.4 = 1-15
(T 11/6) last day to withdraw
(W 11/7) [30] Section 7.4 continued
Traveling Salesman Problem, "Nearest Neighbor" algorithm 		links: Traveling Salesman Problem, TSP Generator
(F 11/9) [31] H4 due (Exercise #4 was discarded)
Q4 = (6.1,6.2,6.3,7.1,7.2,7.3,7.4)
(M 11/12) [32] Section 8.1 = the Chinese Postman Problem Section 8.1 = 1-8
(W 11/14) [33] Section 8.2 = digraphs
Section 8.5 = scheduling problems 		Section 8.2 = 1-9,11,14,15,17-19
Section 8.5 = 1-17
(F 11/16) [34] finish Section 8.5  
(M 11/19) [35] H5 due
Q5 = (8.1,8.2,8.5)
(W 11/21 - F 11/23) Thanksgiving break (no classes)
(M 11/26) [36] Section 9.1 = trees and their properties Section 9.1 = 1-15,23-27a
(W 11/28) [37] Section 9.2 = spanning trees Section 9.2 = 1-14
(F 11/30) [38] Section 9.3 = MST algorithms Section 9.3 = 1-9
(M 12/3) [39] Section 10.1 = planar graphs Section 10.1 = 1-14
(W 12/5) [40] Section 10.1 continued
Section 10.2 = coloring graphs 		Section 10.2 = 1-27
(F 12/7) [41] Section 10.2 continued  
(M 12/10) [42] H6 due
Q6 = (9.1,9.2,9.3,10.1,10.2)