| 1 |
Aug 25 |
1.1, 1.2 |
Read sections 1.1. Ignore the subsection on TautologyTest at the end of section 1.1. The book thinks this is an algorithm, but it is not. Also, read section 1.2 up through Example 10.
Exercises 1.1: 4, 5, 6, 7(a,b), 8, 9, 12, 17, 20(a,c,e), 31, 42
Use a truth table to check whether the following argument is valid. If the refrigerator is cold, then it is turned on. The refrigerator is turned off if and only if it is quiet. The refrigerator is noisy. Therefore the refrigerator is cold.
|
| 2 |
Sep 8 |
1.2-1.4, 2.1 |
Read sections 1.2 through 1.4 and section 2.1.
Note: There are too many exercises to do in one sitting. Plan ahead. Start now.
Exercises 1.2: 1, 7, 10, 13, 15, 23, 29, 33, 38, 45
Exercises 1.3: 2-5, 8-10, 14, 15, 18-25
Exercises 1.4: 2, 6-8, 10, 15, 20, 24, 30, 32
Exercises 2.1: all stared exercises except 35 and 67.
|
| 3 |
Sep 29 |
2.2, 1.6, 2.3, 2.4 |
Read sections 2.2, 1.6, 2.3, and 2.4.
Exercises 2.2: all stared exercises except 23, 54, 56, and 68.
Exercises 1.6: 1, 8, 10
Exercises 2.3: 2, 6, 7, 10, 13, 15
Exercises 2.4: 1, 4, 7, 11, 16, 25, 38, 40-44, 48, 50, 52, 60
Note: section 2.4 has been moved to HW4/Quiz 4.
|
| 4 |
Oct 13 |
2.4-2.5, 3.1-3.2 |
Read sections 2.4-2.5 and 3.1-3.2.
Exercises 2.4: 1, 4, 7, 11, 16, 25, 38, 40-44, 48, 50, 52, 60
Exercises 2.5: 1, 4, 7, 18, 23, 27, 29, 31
Exercises 3.1: 1, 4, 10, 12, 18, 23, 27, 30, 39, 44, 46, 50, 55, 58, 79, 81, 88
Exercises 3.2: 1, 2, 7, 11, 18, 21, 25, 28, 32, 37, 39, 45, 57, 60, 65, 72
|
| 5 |
Nov 3 |
3.3, 3.4, 3.6, 3.7, 4.1 |
Read sections 3.3, 3.4, 3.6, 3.7, and 4.1. In 4.1, you may skip the subsubsection on closures of relations and the subsection on partial orderings.
Exercises 3.3: 2, 6, 9, 19, 24
Exercises 3.4: 1-80(starred problems)
Exercises 3.6: starred problems
Exercises 3.7: starred problems
Exercises 4.1: 1, 4, 5, 6, 8, 12, 37, 42
Note: The bonus problem (from class on Tues. Oct 25) will appear on Quiz 5 and be worth 1 bonus point.
|
| 5 |
Nov 3 |
3.3, 3.4, 3.6, 3.7, 4.1 |
Read sections 3.3, 3.4, 3.6, 3.7, and 4.1. In 4.1, you may skip the subsubsection on closures of relations and the subsection on partial orderings.
Exercises 3.3: 2, 6, 9, 19, 24
Exercises 3.4: 1-80(starred problems)
Exercises 3.6: starred problems
Exercises 3.7: starred problems
Exercises 4.1: 1, 4, 5, 6, 8, 12, 37, 42
Note: The bonus problem (from class on Tues. Oct 25) will appear on Quiz 5 and be worth 1 bonus point.
|
| 6 |
Nov 15 |
4.1, 4.4, 4.5 |
Read sections 4.1 (equivalence relations), 4.4, and 4.5.
Exercises 4.1: How many equivalence relations are there on a set of 4 elements? (Hint: remember the relationship between equivalence relations and partitions.)
Exercises 4.4: 1, 10(a-d), 14, 30, 37, 40, 52, 48, 60, 67
Exercises 4.5: 2, 9, 19, 20, 21, 24
|
| 7 |
- |
5.1 |
Read section 5.1. You may skip the section on computer representation of graphs.
Exercises 5.1: 3, 4, 8, 11, 12, 13-18, 25-29, 31-34, 77
|