| 1 |
Jan 21 |
1.1, 1.2 |
Read sections 1.1 and 1.2. Note: ignore the subsection on TautologyTest at the end of section 1.1. The book thinks this is an algorithm, but it is not.
Exercises 1.1: 1(a,c-g), 4, 7(a,b), 12, 17(a,b), 20(a,c), 31, 42
Exercises 1.2: 1, 7, 10, 13, 15, 23, 29, 33, 38, 45
From Friday's lecture: 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 |
Jan 28 |
1.3, 1.4 |
Read sections 1.3 and 1.4.
Exercises 1.3: 2(a-d), 5(a), 9(a,b,c), 14(b,c), 18(a,b), 19(a), 21, 24(c), 25(a)
Exercises 1.4: 2, 8, 10, 15, 20, 24, 30, 32
|
| 3 |
Feb 4 |
1.6, 2.1, 2.2 |
Read sections 1.6 and 2.1.
Exercises 1.6: 1, 8, 10
Exercises 2.1: all stared exercises except 1, 35, and 67.
Exercises 2.2: all stared exercises except 23, 54, 56, and 68.
Note: Section 2.2 is no longer covered on HW3 or Quiz 3.
|
| 4 |
Test: Feb 11 |
2.2 |
Read section 2.2.
Exercises 2.2: all stared exercises except 23, 54, 56, and 68.
|
| 5 |
Feb 18 |
2.3, 2.4 |
Read sections 2.3 and 2.4. In Section 2.3, you do not need to learn the formal derivation rule for Hoare triples involving loops. Since there are no provisions for ensuring that the loops terminate, I consider this rule misleading at best. Please do learn about loop invariants and how to prove that they hold by induction.
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
|
| 6 |
Feb 25 |
2.4, 2.5, 2.6 |
Review section 2.4. Read sections 2.5 and 2.6.
Exercises 2.4: review all problems from HW#5.
Exercises 2.5: all stared problems
Exercises 2.6: 5, 9, 13
|
| 7 |
Mar 4 |
3.1, 3.2, 3.3 |
Read sections 3.1, 3.2, and 3.3.
Exercises 3.1: 1, 10, 12, 18, 23, 27, 30, 39, 44, 46, 50, 55, 58, 79, 81, 88
Exercises 3.2: 1, 11, 18, 21, 25, 28, 32, 37, 39, 45, 57, 60, 65, 72,
Exercises 3.3: 2, 6, 9, 19, 24
|
| 8 |
Test: Mar 21 |
3.3-3.5 |
Read sections 3.3, 3.4, and 3.5. In 3.4, you may skip the part about the permutation generator and the combination generator. In 3.5, you may skip the section on Expected Value.
Exercises 3.3: 2, 6, 9, 19, 24
Exercises 3.4: 1-80(starred problems)
Exercises 3.5: 1-58(starred problems)
|
| 9 |
Mar 25 |
3.6 |
Read section 3.6.
Exercises 3.6: starred problems
|
| 10 |
Apr 1 |
3.7, 4.5 |
Read sections 3.7 and 4.5. In 4.5, you may skip material beginning with example 54 on p. 374.
Exercises 3.7: starred problems
Exercises 4.5: 2, 9, 19, 20, 21, 24
|
| 11 |
Apr 8 |
4.4, 5.1 |
Read section 4.4.
Exercises 4.4: 1, 10(a-d), 14, 30, 37, 40, 52, 48, 60, 67
Exercises 5.1: TBA
|
| 12 |
Apr 15 |
5.1, 5.2 |
Read sections 5.1 and 5.2. In 5.1, you may skip the section on computer representation of graphs. In 5.2, you may skip the short section on Binary Tree Representation.
Exercises 5.1: 3, 4, 8, 11, 13-18, 25, 27, 31, 33, 70, 77
Exercises 5.2: 1, 4, 16, 20, 22, 26, 38
|
| 13 |
Test 3: Apr 20 |
5.3 |
Read section 5.3.
Exercises 5.3: 1, 5, 13, 16
|