| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
Aug 24 |
|
Foundations. Sets (1.1) |
pg 24: 1, 2, 8, 9, 10, 11. Due 8/26
|
|
|
Aug 26 |
|
Sets (1.1); into to ML (DF 1) |
DF 1. Due 9/2
pg 24: 4, 12, 14, 16, 22, 30, 32 (visually). Due 8/29
|
|
|
Aug 29 |
|
Logic (1.2) |
pg 43: 2, 4, 6, 8, 9, 14, 18, 20, 21, 22. Due 8/31
|
|
|
Aug 31 |
|
Logic (1.2), arguments(1.3) |
pg 43: 9, 14, 18, 20, 21, 22, 24, 26, 28, 32. Due 9/2
|
|
|
Sept 2 |
|
More arguments(1.3), predicates (1.4) (DF 2) |
pg 52: 2, 4, 6, 8, 10, 14, 16, 18
|
|
| |
|
Sept 7 |
|
Quantification (1.4) |
DF 2. Due 9/12
pg 62: 2, 4, 6, 8, 14, 16, 18, 28
|
|
|
Sept 9 |
|
Proof (1.5) |
pg 72: 2, 4, 6, 10, 12
|
|
|
Sept 12 |
|
More Proof (1.5), proof on sets, lists (DF 3) |
DF 3. Due 9/19
pg 25: 20, 24a, 26; pg 72: 8, 22b<->c, 23b<->c, 25a<->c, 28
|
|
|
Sept 14 |
|
Practice proofs, properties on sets |
Handout assignment 7-13: [ps]
[pdf]
|
|
|
Sept 16 |
|
Algorithms (1.6) (DF 4) |
DF 4. Due 9/23
|
|
| |
|
|
Sept 23 |
|
Integers and induction. Integers, GCD (2.1) |
pg 111: 11. Due 9/26
|
|
|
Sept 26 |
|
Math induction (2.3) |
pg 111: 12, 13; pg 147: 2, 4, 8, 14, 21, 22b. Due 9/28
|
|
|
Sept 28 |
|
Correctness of algorithms (2.3) |
pg 148: 26-28. Due 10/3
#28 refers to pg 99; use Thm 2.1.6 in proof
|
|
|
Sept 30 |
|
From theorems to algorithms (DF 5) |
DF 5. Due 10/7
|
|
|
Oct 3 |
|
Relations. Relations (3.1) |
pg 205: 1a-c, 4, 6, 7, 8, 12b->c, 17a-c, 20, 21, 22, 23, 28, 29a-b. Due 10/7
|
|
|
Oct 5 |
|
Properties of relations (3.1) |
|
|
|
Oct 7 |
|
Closures(3.1). Relations as predicates (DF 6). |
pg 207: 25, 26, 27. Due 10/10
DF 6. Due 10/12
|
|
|
Oct 10 |
|
Relations as predicates (DF 6). |
|
|
|
Oct 12 |
|
Partial orders (3.2) |
pg 225: 2, 6, 8, 25, 35. Due 10/14
|
|
|
Oct 14 |
|
Functions. Functions (5.1) |
pg 297: 1, 4, 8, 12
|
|
| |
|
|
Oct 21 |
|
Properties of functions (5.1) |
Handout assignment 7, 11, 13, 16, 17, 18, 24 [ps]
[pdf], due 10/24
|
|
|
Oct 24 |
|
More functions, inverse functions (5.2) |
|
|
|
|
|
Oct 31 |
|
Go over test |
p 207, 29f; handout 3, 6, 8, 12
|
|
|
Nov 2 |
|
Functions in ML (DF 7) |
DF 7, due 11/7
|
|
|
Nov 4 |
|
Set operations in ML (DF 8) |
DF 8, due 11/9
|
|
|
Nov 7 |
|
First class functions (DF 9) |
DF 9, due 11/11
|
|
|
Nov 9 |
|
Counting. Basic counting (7.1) |
Pg 429: 9, 10, 11, 12, 28, 29
|
|
|
Nov 11 |
|
Permutations and combinations (7.3 and 7.4) |
Pg 442: 7, 8, 11; pg 447: 11, 12, 14, due 11/14
ML function to compute all r-permutations of a list, due 11/16
|
|
|
Nov 14 |
|
Recursion. Recurrence relations (8.1) |
Pg 511: 3, 5, 6, 7, 8, 19
|
|
|
|
|
Nov 21 |
|
Analysis of algorithms (9.1) |
|
|
|
|
|
Nov 28 |
|
Graph theory. Graph definitions (10.1) |
Pg 617: 1, 2, 3, 4, 5, 27, 29, due 11/30
|
|
|
Nov 30 |
|
Paths and cycles (10.2 and 10.4) |
Pg 634: 1, 2, 5, 12; pg 660: 1, due 12/2
|
|
|
Dec 2 |
|
Isomorphisms (10.5) |
pg 660: 7, 15; pg 668: 1; handout 11 [ps]
[pdf], due 12/5
|
|
| |
|
|