| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
|
| |
|
Sept 3 |
|
Intro to ML; cardinality and Cartesian products. 1.(6-9).
Slides |
Pg 26: 1.6.(1-5)
Pg 32: 1.8.(1, 4, 5)
Pg 36: 1.9.(3, 4, 8, 9, 10).
Note that the ML problems should be submitted on paper with the rest of the assignment.
Skim 1.(10&11)
|
|
|
|
Sept 8 |
|
Functions in ML. 1.(11-13).
Code from class |
Pg 48: 1.11.(4, 8, 10)
Pg 50-51: 1.12.(3, 5, 8)
Read 2.1
Skim 2.2
|
|
|
Sept 10 |
|
List. Introduction to lists. 2.(1 & 2)
Code from class |
Pg 70: 2.1.(2-4, 7)
Pg 74: 2.2.(2, 3, 8, 9)
Skim 2.3
Read 2.4
|
|
|
Sept 12 |
|
More about lists; powersets. 2.(3 & 4)
Code from class |
Pg 74: 2.2.(11, 13, 15)
Pg 82: 2.4.(8-12, 14 & 15)
Read carefully 2.5
Skim 2.6
|
|
|
Sept 15 |
|
A language processor. 2.(5 & 6)
Code from class |
Pg 91: 2.B
Read carefully 3.(1 & 2)
Read 3.(3 & 4)
|
|
|
Sept 17 |
|
Proposition. Propositional forms; boolean values; logical equivalence. 3.(1-4)
Slide |
Pg 102: 3.3.(5 & 6)
Pg 105: 3.4.(2, 4, 8-12)
Read 3.(5-7)
|
|
|
Sept 19 |
|
Conditionals. 3.(5-7)
Slides
Code from class |
Pg 108: 3.5.(1 & 2)
Pg 114: 3.7.(1, 2, 7, 8, 9, 12, 13)
Read 3.(8 & 9)
|
|
|
Sept 22 |
|
Arguments. 3.(8 & 9)
Slides |
Pg 119: 3.8.(3 & 5)
Pg 122: 3.9.(3-7)
Read carefully 3.(10 & 11)
Skim 3.(12 & 13)
|
|
|
Sept 24 |
|
Predicates; quantification. 3.(10-13)
Code from class |
Pg 133: 3.12.(1 & 2)
Pg 135:3.13.(4 & 5)
Read 3.14
|
|
|
Sept 26 |
|
Quantification and arguments. 3.14
Slides |
Pg 139: 3.14(6-9)
|
|
| |
|
|
Oct 3 |
|
Proof. Introduction to proofs; subset proofs. 4.(1 & 2) |
Pg 158:4.2.(2-7)
Read 4.(3 & 4)
|
|
|
Oct 6 |
|
Set equality proofs; set emptiness proofs. 4.(3 & 4) |
Pg 160: 4.3.(3, 14, 15, 18)
Pg 161: 4.4.(5,6)
Read 4.(5-8)
|
|
|
Oct 8 |
|
Conditional proofs. 4.(5-8) |
Pg 162: 4.5.(1, 4, 5)
Pg 164: 4.6.(2,5)
Pg 165: 4.7.(1, 6)
Review 2.4, especially Ex 2.4.15
Skim 4.9
|
|
|
Oct 10 |
|
Powersets. 4.9
Slides |
Pg 174: 4.9.(1, 3, 4, 6)
Skim 4.(10 & 11)
|
|
|
Oct 13 |
|
From theorems to algorithms. 4.(10 & 11)
Code from class |
Pg 177: 4.10.(3, 4, 6)
Read carefully 5.1
Read 5.(2 & 3)
|
|
|
Oct 15 |
|
Relation. Introduction. 5.(1-3) |
Pg 205: 5.3.(8, 10, 12, 13)
Read 5.4
|
|
|
Oct 17 |
|
Properties of relations. 5.4 |
Pg 205: 5.3.(5, 6, 11, 14)
Pg 208: 5.4.(3-5, 22, 24, 25, 26)
Pg 212: 5.5.(5, 7, 9, 10)
All above due Oct 24
Read 5.5
|
|
| |
|
Oct 22 |
|
Equivalence relations. 5.5 |
See Oct 17 for assignment
Read 5.(6 & 7)
|
|
|
Oct 24 |
|
Transitive closure. 5.(6 & 7)
Code from class |
Pg 217: 5.6.(1&3)
Pg 222: 5.7.(3&5)
Read 5.(8 & 9)
|
|
|
Oct 27 |
|
Partial order relations; topological sort. 5.(8 & 9)
Slides |
Pg 226: 5.8.(1-5)
Pg 231 5.9.(1 & 8)
|
|
|
|
| |
|
Nov 5 |
|
Structural induction. 6.4 |
Pg 268: 6.4.(3,4,6,7)
Skim 6.(5 & 6)
|
|
|
Nov 7 |
|
Mathematical induction. 6.(5 & 6) |
Pg 273: 6.5.(2 & 4)
Pg 278: 6.6.(2 & 3). Due 11/12
Read 6.9 carefully
Skim 6.10
|
|
|
Nov 10 |
|
Loop invariants. 6.(9 & 10)
Code from class |
Pg 306: 6.10.(2-5). Due 11/14
|
|
|
Nov 12 |
|
More on loop invariants. 6.(10-11) |
Read 7 intro and 7.1 carefully
Read 7.2
Skim 7.3
Practice exercises
|
|
|
|
Nov 17 |
|
Images and inverse images. &.(4 & 5)
Code from class |
Pg 342: 7.4.(2, 5, 8, 9, 10)
Read 7.(6-8)
|
|
|
Nov 19 |
|
Function properties; inverse functions; composition. 7.(5-8) |
Pg 346: 7.6.(2, 3, 6)
Pg 351: 7.8.(1, 5, 6)
Skim 7.9
|
|
|
|
Nov 24 |
|
No-credit quiz. Countability. 7.15
Slides |
|
|
|
|
| |
|
|
|
Dec 8 |
|
Fixed-point iteration. 7.(12 & 13)
Code from class |
Pg 375: 7.13.(1,3)
Skim 6.12
|
|
|
|