210 HOMEWORK MWF 2006 January 30 MATH 210:
DISCRETE MATH Dr. Luft
|
Day Intr |
Les Nr |
Sec |
HW Pag |
"Practice Exercises" Answers in Appendix B |
"Problems" ?=optional |
Topics |
|
Jan |
|
|
|
JANUARY |
|
|
|
30M |
1- |
0.3 1.0 |
16 24 |
5-6, 8, 16 |
1?, 4a-f 1? |
Numbers Sets |
|
Feb |
|
|
|
FEBRUARY |
|
|
|
1W |
1a |
1.0 |
24 |
1-4, 9-12, 18 |
|
|
|
3F |
2 |
1.1 |
34 |
1af, 2af, 3af, 5-10 |
3? 4? |
Set Equality |
|
6M |
3- |
1.2 |
39 |
1dghjkl, 2abcdef, 3abjk |
1? |
Set Identities |
|
8W |
3a |
1.2 |
40 |
3abfhiklmno, 1-4, 5ab |
|
Set Identities; Functions |
|
10F |
4 |
1.3 |
46 |
6,7-8,9, 10, Y1-4 |
1-2, 3?, 6? |
Functions, Relations |
|
13M |
5- |
1.4 |
55 |
1, 4 |
|
Relation on Set |
|
15W |
5a |
1.4 |
56 |
Y1, 2, 3,
5 |
|
Equivalence Relation |
|
17F |
6 |
1.5 |
66 |
1, 4-12, Y2-3 |
|
Modular Arithmetic |
|
20M |
7 |
1.6 |
73 |
1-10 |
|
Partial Order |
|
22W |
8- |
2.0 |
85 |
1b-h, 1m, 8 |
1, 2?,
3?, 4? |
4 Theorem types |
|
24F |
8a |
2.0 |
86 |
2-3, 6-7, 9-10 |
|
|
|
27M |
R1 |
|
?71,99 |
REVIEW 1 |
|
|
|
Mar |
|
|
|
MARCH |
|
|
|
1W |
T1 |
|
|
TEST 1 |
|
|
|
3F |
9- |
2.1 |
92 |
Y1, 3, Y2 |
2? |
Math Induction: Sums |
|
6M |
9a |
2.1 |
92 |
4, 1, 5, 7 |
|
Math Induction:
Divisibility |
|
8W |
10 |
2.1 |
92 |
6, 9, 2, 10 |
|
Math Induction:
Inequalities |
|
10F |
11- |
2.2 |
98 |
1, 3 |
2, 3 |
More Induction |
|
13M |
11a |
2.2 |
98 |
4, 5 |
|
Strong Induction |
|
15W |
12 |
2.3 |
103 |
1, 2, 3 |
|
Quantifiers |
|
17F |
13- |
0.1 3.0 |
8 116 |
1-7 |
1, 2 1-3? |
Combinations Multiplication Rule |
|
|
|
|
|
SPRING VACATION |
|
|
|
27M |
13a |
3.1 |
127 |
4, 10, 11, 13, 15, Y1 |
|
Ordered Samples |
|
29W |
14 |
3.1 |
127 |
1, 2, 3, 5, 14, Y1-2 |
|
Equivalence Classes |
|
31F |
15- |
3.2 |
144 |
4, 5, 6, 10 Note |
|
Unordered Samples |
|
Apr |
|
|
|
APRIL |
|
|
|
3M |
15a |
3.2 0.2 |
144 11 |
1, 3, 9 |
5? 1, 5 |
Königsberg |
|
5W |
R2 |
|
|
REVIEW 2 |
|
|
|
7F |
T2 |
|
|
TEST 2 |
|
|
|
10M |
16 |
4.0 |
182 |
Writing: 1, 2 ; Practice:
1-3 |
|
Intro to Graphs |
|
12W |
17- |
4.1 |
191 |
2, 4, 6 Note |
|
Graphs, Cycles |
|
14F |
17a |
4.1 |
191 |
3, 5, 7 |
|
Adjacency Matrices |
|
17M |
18 |
4.2 |
199 |
1, 4-6, 8, 10? |
|
Spanning Trees |
|
19W |
19- |
4.3 |
206 |
1, 6, 8b |
|
Minimum Cost |
|
21F |
19a |
4.3 |
206 |
2, 9 |
|
Shortest Path |
|
24M |
20- |
4.4 |
213 |
2, 6 |
|
In-order Searches |
|
26W |
20a |
4.4 |
213 |
1, 3 |
|
Pre-/Post-order Searches |
|
28F |
21- |
4.5 |
220 |
1, 2, 4 Note |
|
Euler's Theorem |
|
|
|
|
|
THERE ARE TWO PAGES |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Day Intr |
Les Nr |
Sec |
HW Pag |
"Practice Exercises" Answers in Appendix B |
"Problems" ?=optional |
Topics |
|
May |
|
|
|
MAY |
|
|
|
1M |
21a |
4.5 |
220 |
3, Y1-Y4 |
1 |
Edge-Vertex Inequality |
|
3W |
22 |
5.0 5.1 |
188 198 |
Writing: 3, 4 3-6, 9-10, 12-13;18-19,
22-23, 25 |
|
Analogies Propositional Calculus |
|
5F |
R3 |
|
|
REVIEW 3 |
|
|
|
8M |
T3 |
|
|
TEST 3 |
|
|
|
10W |
23 |
5.1 |
199 |
27-29, 33-36, 37, 39-40 |
|
Valid Arguments |
|
12F |
24 |
5.2 |
207 |
1, 2, 3, 8, 11, 12, 13, … Note |
|
Boolean Algebra |
|
15M |
R9 |
|
|
|
|
|
|
24W |
T9 |
|
|
FINAL Exam Same Rm 10:45 |
|
|