| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
Aug 25 |
|
Set. Sets and elements. 1.(1-4)
Slides |
Pg 10: 1.4.(1-16)
Read 1.5
Read 1.(6-8)
|
|
|
Aug 27 |
|
Set operations. ML expressions. 1.(5-8) |
Pg 14: 1.5.(1-6, 20); Pg 21: 1.6.(6&7); Pg 24: 1.7.2; Pg 27: 1.8.(5&6)
Read 1.(9&10)
|
|
|
Aug 30 |
|
Visual verification. ML functions. 1.(9&10)
Slide
Code from class |
Pg 31: 1.9.(9-13); pg 37: 1.10.(2, 4, 5, 8)
Read 1.11
Read 1.12
|
|
|
Sept 1 |
|
ML lists. 1.(11&12)
Code from class |
Pg 42: 1.11.(5-7, 14-16); pg 46: 1.12.(3, 4, 10, 11, 12)
Read 1.13
Read 1.(14 & 15)
|
|
|
Sept 3 |
|
Cartesian product. Powersets. 1.(13-15)
Code from class |
Pg 54: 1.4.(9-11; 14 & 15)
Read 1.(15 & 16)
Read 1.17
|
|
| |
|
Sept 8 |
|
A language processor. 1.(16&17)
Code from class |
Pg 57: 1.15.(8-12, 14 & 15); Pg 70 (1.17): 1.B
Read 2.(1 & 2)
Read 2.(3 & 4)
|
|
|
Sept 10 |
|
Proposition. Forms, boolean values, logical equivalence. 2.(1-4)
Slides |
Pg 81: 2.3.(5&6); pg 85: 2.4.(2, 4, 8-12)
Read 2.(5-7)
|
|
|
Sept 13 |
|
Conditionals. 2.(5-7)
Slides
Code from class |
Pg 89: 2.5.(1&2); pg 95: 2.7.(1&2, 6-8, 11&12
Read 2.(3 & 4)
|
|
|
Sept 15 |
|
Arguments. 2.(8&9)
Slides |
Pg 99: 2.8.(3, 5); pg 101: 2.9.(3-7)
Read 2.(10 & 11)
Read 2.(12 & 13)
|
|
|
Sept 17 |
|
Predicates and quantification. 2.(10-12) |
Pg 112: 2.12.(1&2, 6-7)
Read 2.(13)
Read 2.(14)
|
|
|
Sept 20 |
|
Quantification and arguments. 2.(13&14)
Slides
Code from class |
Pg 114: 2.13.(3&4); pg 118: 2.14.(6-9)
|
|
|
|
|
Sept 27 |
|
Proof. Subset proofs. 3.(1&2) |
Pg 138: 3.2.(2-7)
Read 3.(3&4)
|
|
|
Sept 29 |
|
Set equality and set emptiness proofs. 3.(3&4) |
Pg 140: 3.3.(3, 14, 15, 18); pg 141: 3.4.(5 & 6)
Read 3.(5&8)
|
|
|
|
Oct 4 |
|
Conditional proofs. 3.(5-9) |
Pg 143: 3.5.(1, 4, 5); pg 144: 3.6.(2, 5); pg 145: 3.7.(1, 6)
Read 3.9
|
|
|
Oct 6 |
|
Powersets. 3.9
Slides |
Pg 152: 3.9.(1, 3, 4, 6)
Read 3.10
Read 3.11
|
|
|
Oct 8 |
|
From theorems to algorithms; solving games. 3.(10&11)
Code from class |
Pg 155: 3.10.(3, 4, 6)
Read 4.1
Read 4.(2&3) |
|
|
Oct 11 |
|
Relation. Introduction. 4.(1-3)
Slides |
Pg 181: 4.3.(5, 7, 9, 11, 12, 13-15)
Read 4.(4&5) |
|
|
Oct 13 |
|
Properties of relations. 4.4 |
Pg 184: 4.4.(6-9, 22, 24, 26)
|
|
|
Oct 15 |
|
Equivalence Relations. 4.5 |
Pg 187: 4.5.(5, 7, 9, 10)
Read 4.(4&5)
|
|
| |
|
Oct 20 |
|
Transitive closure. 4.(6&7)
Code from class |
Pg 192: 4.6.(1 & 3); pg 198: 4.7.(3 & 5)
Read 4.(6 & 7)
|
|
|
Oct 22 |
|
Partial orders 4.(8&9)
Slides |
Pg 201: 4.8.(1-5); pg 205: 4.9.(1 & 7)
|
|
| |
|
|
| |
|
Nov 3 |
|
Math induction. 5.(5&6) |
5.5.(2&4); 5.6.1
Read 5.9
Read 5.10
|
|
|
Nov 5 |
|
Loop invariants. 5.(9&10) |
|
|
|
Nov 8 |
|
More loop invariants. 5.(10&11) |
Pg 278: 5.10.(2-5)
Read 5.12
|
|
|
Nov 10 |
|
Huffman encoding. 5.12
Slides |
Pg 288: 5.(A-D)
Read 6 intro and 6.1
Read 6.2
Read 6.3
|
|
|
Nov 12 |
|
Function. Introduction. 6.(1-3)
Code from class |
Pg 303: 6.2.(2 & 3); pg 307: 6.3.(3, 4, 8)
Read 6.4
Read 6.5
|
|
|
Nov 15 |
|
Images and inverse images. 6.(4&5)
Code from class |
Pg 314: 6.4.(2, 5, 8, 9, 10); pg 316: 6.5.(1, 5, 6)
Read 6.(6-8)
|
|
|
Nov 17 |
|
Properties; inverse functions; composition. 6.(6-8) |
Pg 318: 6.6.2; pg 323:6.8.(1, 5, 6, 7, 9)
Read 6.9
|
|
|
Nov 19 |
|
Cardinality. 6.9
Slides |
Pg 331: 6.9.(1 & 2)
|
|
|
Nov 22 |
|
No-credit quiz. Special topics.
Slides |
|
|
|
|
| |
|
|
Dec 3 |
|
Program. Fixed-point iteration. 7.(1&2)
Code from class |
Pg 371: 7.2.(1,3,4)
|
|
| |
|
|
