| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
|
|
Aug 31 |
|
Intro to ML; cardinality and Cartesian products. 1.(6-9). |
Pg 26: 1.6.(1-5)
Pg 32: 1.8.(2, 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)
Optional:
Video for sections 1.(10 & 11)
Video for sections 1.(12)
|
|
|
Sept 2 |
|
Making things in ML. 1.(10-13). |
Pg 36: 1.9.(14 & 16)
Pg 40: 1.10.(1-4)
ML problems should still be submitted on paper
Re-read 1.11 (if necessary), skim 1.(12 & 13).
Read 2.1
Skim 2.2
Optional:
Video for section 2.1
Video for Section 2.2
|
|
|
Sept 4 |
|
More about functions in ML. 1.(11-13); List. Introduction to lists. 2.(1 & 2) |
Pg 48: 1.11.(4, 8, 10)
Pg 50-51: 1.12.(3, 5, 8)
Pg 70: 2.1.(2-4, 9, 10)
Notes on assignment
Starting with this assignment, submit ML problems electronically
Recommendation: start working on problems from 2.2 assigned next time
Skim 2.3
Read 2.4
Optional:
Video for Section 2.4
|
|
| |
|
Sept 9 |
|
More about lists; powersets. 2.(3 & 4) |
Pg 74: 2.2.(2, 3, 8, 9, 11, 13, 15)
Pg 82: 2.4.(8-12)
Notes on assignment
Read carefully 2.5
Skim 2.6
|
|
|
Sept 11 |
|
A language processor. 2.(5 & 6) |
Pg 82: 2.4.(14 & 15)
Pg 91: 2.B
Notes on 2.B
Read 3.(1-4)
|
|
|
Sept 14 |
|
Proposition. Propositional forms; boolean values; logical equivalence. 3.(1-4) |
Pg 102: 3.3.(5 & 6)
Pg 105: 3.4.(2, 4, 8-12)
Read 3.(5-7)
|
|
|
Sept 16 |
|
Conditionals. 3.(5-7) |
Pg 108: 3.5.(1 & 2)
Pg 114: 3.7.(1, 2, 7, 8, 9, 12, 13)
Read 3.(8 & 9)
|
|
|
Sept 18 |
|
Arguments. 3.(8 & 9) |
Pg 119: 3.8.(3 & 5)
Pg 122: 3.9.(3-7)
Read carefully 3.(10 & 11)
Skim 3.(12 & 13)
|
|
|
Sept 21 |
|
Predicates; quantification. 3.(10-13) |
Pg 133: 3.12.(1 & 2)
Pg 135:3.13.(4 & 5)
Read 3.14
|
|
|
|
| |
|
Sept 30 |
|
Proof. Introduction to proofs; subset proofs. 4.(1 & 2) |
Pg 158:4.2.(2-7)
Review 4.(1 & 2)
Read 4.(3 & 4)
|
|
|
Oct 2 |
|
Set equality proofs; set emptiness proofs. 4.(3 & 4) |
Pg 160: 4.3.(3, 14, 15, 18)
Pg 161: 4.4.(5,6)
Notes on assignment
Read 4.(5-8)
|
|
|
Oct 5 |
|
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 7 |
|
Powersets. 4.9 |
Pg 174: 4.9.(1, 3, 4, 6)
Skim 4.(10 & 11)
|
|
|
Oct 9 |
|
From theorems to algorithms. 4.(10 & 11) |
Pg 177: 4.10.(3, 4, 6)
Correction to Ex 4.10.6
Read carefully 5.1
Read 5.(2 & 3)
|
|
| |
|
Oct 14 |
|
Properties of relations. 5.4 |
Pg 205: 5.3.(5, 11, 14)
Pg 208: 5.4.(3, 4, 5, 22, 24, 25)
Pg 212: 5.5.(7, 9, 10)
Duedate open
Read 5.5
|
|
|
Oct 16 |
|
Equivalence relations. 5.5 |
Read 5.(6 & 7)
|
|
| |
|
|
Oct 23 |
|
Partial order relations; topological sort. 5.(8 & 9) |
Pg 226: 5.8.(1-5)
Pg 231 5.9.(1 & 8)
|
|
| |
|
|
|
Nov 2 |
|
Structural induction. 6.4 |
Pg 268: 6.4.(3,4,6,7)
Skim 6.(5 & 6)
|
|
|
Nov 4 |
|
Mathematical induction. 6.(5 & 6) |
Pg 273: 6.5.(2 & 4)
Pg 278: 6.6.(2 & 3).
Read 6.9 carefully
Skim 6.10
|
|
|
Nov 6 |
|
Loop invariants. 6.(9 & 10) |
Pg 306: 6.10.(2-5). Due Nov 11
|
|
|
Nov 9 |
|
More on loop invariants. 6.(10-11) |
Read 7 intro and 7.1 carefully
Read 7.2
Skim 7.3
|
|
|
Nov 11 |
|
Function. Introduction. 7.(1-3) |
Pg 331: 7.2.(2&3)
Pg 335: 7.3.(3, 4, 8)
Read 7.4
Skim 7.5
|
|
|
Nov 13 |
|
Images and inverse images. 7.(4 & 5) |
Pg 342: 7.4.(2, 5, 8, 9, 10)
Read 7.(6-8)
|
|
|
Nov 16 |
|
Map and filter; function properties; inverse functions; composition. 7.(5-8) |
Pg 346: 7.6.(2, 3, 6)
Pg 351: 7.8.(1, 5, 6)
Programming problems
Skim 7.9
|
|
|
Nov 18 |
|
Cardinality. 7.9 |
Pg 359: 7.9.(1 & 2)
|
|
|
Nov 20 |
|
No-credit quiz. Countability. 7.15 |
|
|
| |
|
|
| |
|
|
Dec 4 |
|
Map and foldl; modeling functions. 7.(5 & 14) |
Programming problems
Read 7.12 carefully
Skim 7.13
|
|
| |
|
|