Computer Science 243

Aug 24

NO CLASS

Aug 26

Set. Sets and elements. 1.(1-4)
Slides
One-set exercises
Two-set exercises

Pg 10: 1.4.(1-12)

Aug 28

Introduction to ML. 1.5

Pg 10: 1.4.(17-21)
Pg 14: 1.5.1-6

Aug 31

Visual verification; functions in ML. 1.(6 &7)

Pg 16: 1.6.(5-9)

Sep 2

Functions in ML; more set topics 1.(7 & 8)
Code from class

Pg 18: 1.7.(1, 3, 5)
Pg 20: 1.8.(1-5)

Sep 4

Lists. 1.(9 & 10)
Code from class

Pg 23: 1.9.(4,5)
Pg 24: 1.10.(1, 2, 3, 5, 6, 9)

Sep 7

NO CLASS

Sep 9

Cartesian products, powersets. 1.(11 & 12)
Code from class

Pg 26: 1.11.(9, 12, 14, 15)
Pg 27: 1.12.(1-4, 9-12)

Sep 11

Datatypes, and other ML types. 1.(13-15)
Code from class: From the book; Language example;

Pg 30: 1.13(1-3)

Sep 14

Proposition. Forms, symbols, boolean values; logical equivalences. 2.(1-4)
Slides

Pg 40: 2.3.2
Pg 42: 2.4.(1, 3, 6-9)

Sep 16

Conditionals. 2.(5-8)
Code from class

Pg 45: 2.6.(1-3, 9-12)
Pg 47: 2.7.(1-4)

Sep 18

Arguments. 2.(9 & 10)

Pg 51: 2.9.(3-5)
Pg 52: 2.10.(4-7)

Sep 21

Predicates and quantification. 2.(11 & 12)

Pg 56: 2.12.(1-11)

Sep 23

Multiple quantification. 2.(13 & 14)

Pg 58: 2.13.(1-8)
Pg 60: 2.14.(1-4)

Sep 25

Quantification and natural language. 2.15.

Sept 28

Review

Sept 30

TEST

Oct 2

Proof. Subset proofs. 3.(1 & 2)

Pg 69: 3.2.(2, 3, 5, 6, 7)

Oct 5

Set equality and set emptiness. 3.(3 & 4)

Pg 70: 3.3.(3, 9, 16)
Pg 71: 3.4.(2, 3, 5, 6)

Oct 7

Conditionals, biconditionals, and integers. 3.(5-8)

Pg 73: 3.6.(2, 3, 5, 6)
Pg 73: 3.7.(3, 4)
Review section 1.12 and exercise 1.12.12
Skim section 3.9

Oct 9

Powersets. 3.9
Slides

Pg 77: 3.9.(1, 2, 3, 5)

Oct 12

From theorems to algorithms. 3.10

Pg 79: 3.10.(2-4)

Oct 14

Relation. Definition, representation, and images. 4.(1-3)
Slides
Two-set relation exercises
One-set relation exercises

Pg 86: 4.1.(1-2)

Oct 16

Relations. 4.3

Pg 89: 4.3.(5, 7-9)

Oct 19

NO CLASS

Oct 21

Properties. 4.(4-5)

Pg 91: 4.4.(3-4)
Pg 93: 4.5.(4, 5-7)
READ 4.7

Oct 23

Transitivity. 4.(7-9)

Pg 97: 4.7.1
Pg 99: 4.8.(2 & 3)
Pg 101: 4.9.1

Oct 26

Review

Oct 28

TEST

Oct 30

Partial orders. 4.(10 & 11)
Slides

Nov 2

Self-reference. Recursive types. 5.(1 & 2)
Slides
Code from class and for the assignment

Pg 114: 5.1.(13-15)
Pg 116: 5.2.(5, 7-9, 11, 12-15

Nov 4

Huffman encoding. 5.3
Slides
Code from class and for the assignment

Pg 121: 5.3.(1-4)

Nov 6

Structural induction. 5.4

Pg 124: 5.4.(2-5).
READ 5.5

Nov 9

Mathematical induction. 5.(5 & 6)

Pg 127: 5.5.(1,3,4).
Pg 131: 5.6.(1, 3)
READ 5.7

Nov 11

Loop invariants. 5.(7-9)

Pg 141: 5.8.(3-5)
READ 6.2

Nov 13

Function. Introduction to functions. 6.(1-3)
Two-set relation exercises
Code from class and for the assignment

Pg 147: 6.1.1
Pg 148: 6.2.(2 & 3)
Pg 150: 6.3.(5 & 6)
READ 6.4

Nov 16

Images and inverse images. 6.(4 & 5)

Pg 155: 6.4.(5-10)
READ 6.(6-8)

Nov 18

Function properties and composition. 6.(6-8)

Pg 158: 6.6.(3, 6)
Pg 162: 6.8.(1, 3, 5, 8)

Nov 20

Cardinality. 6.9
Slides

Pg 167: 6.9.(1 & 2)

Nov 23

No-credit quiz.
Special topics.
Slides

Nov 25

NO CLASS

Nov 27

NO CLASS

Nov 30

Review

Dec 2

TEST

Dec 4

Program. Fixed-point iteration. 7.(1 & 2)
Code from class

Pg 183: 7.1.(1, 3)
Pg190: 7.2.(1, 3, 4)

Dec 7

Pipe and filter. 7.(3-5)
Code from class
Code for the assignment

Pg 197: 7.4.(1-3)
READ 7.6

Dec 9

Memoization. 7.(6-8)
Code from class
Code for the assignment

Dec 11

Review