CSCI 243. Discrete Mathematics and Functional Programming


Fall 2022
Thomas VanDrunen



Meeting time: MWF 2:15pm-3:25pm.
Meeting place: Meyer (SCI) 184

Office hours: Drop-in 3:30-4:30 MWF; also schedule through Calendly
Contact: Meyer (SCI) 163 Science; 752-5692; Thomas.VanDrunen@wheaton.edu


Syllabus

ML programming guide

Programming assignment turn-in page.

Frequently asked questions.




Final exam: Thurs, Dec 15, 1:30-3:30pm


Moon's dayWoden' s dayFrigga's day

Aug 22

NO CLASS

Aug 24

Sets. Sets and elements. 1.(1 & 2)

Supplemental videos:
Video for course introduction
Video for sections 1.1-3

Aug 26

Set operations; visual verification (3-5)

Supplemental videos:
Video for section 1.4
Video for section 1.5

Aug 29

Intro to ML; cardinality and Cartesian products. 1.(6-9).

Supplemental videos:
Video for section 1.6
Video for sections 1.(8 & 9)

Aug 31

Making things in ML. 1.(10-13).

Supplemental videos:
Video for sections 1.(10 & 11)
Video for sections 1.(12)

Sept 2

More about functions in ML. 1.(11-13); List. Introduction to lists. 2.(1 & 2)

Supplemental videos:
Video for section 2.1
Video for Section 2.2

Sept 5

NO CLASS

Sept 7

More about lists; powersets. 2.(3 & 4)

Supplemental videos:
Video for Section 2.4

Sept 9

A language processor. 2.(5 & 6)

Sept 12

Proposition. Propositional forms; boolean values; logical equivalence. 3.(1-4)

Sept 14

Conditionals. 3.(5-7)

Sept 16

Arguments. 3.(8 & 9)

Sept 19

Predicates; quantification. 3.(10-13)

Sept 21

Quantification and arguments. 3.14

Sept 23

Review

Sept 26

TEST

Sept 28

Proof. Introduction to proofs; subset proofs. 4.(1 & 2)

Sept 30

Set equality proofs; set emptiness proofs. 4.(3 & 4)

Oct 3

Conditional proofs. 4.(5-8)

Oct 5

Powersets. 4.9

Oct 7

From theorems to algorithms. 4.(10 & 11)

Oct 10

Relation. Introduction. 5.(1-3)

Oct 12

Properties of relations, part 1. 5.(4&5)

Oct 14

Properties of relations, part 2. 5.(4&5)

Oct 17

NO CLASS

Oct 19

NO CLASS

Oct 21

Transitive closure. 5.(6 & 7)

Oct 24

Partial order relations; topological sort. 5.(8 & 9)

Oct 26

Review

Oct 28

TEST

Oct 31

Self Reference. Recursive types. 6.(1-3)

Nov 2

Structural induction. 6.4

Nov 4

Mathematical induction. 6.(5 & 6)

Nov 7

Loop invariants, part 1. 6.(9 & 10)

Nov 9

Loop invariants, part 2. 6.(9 & 10)

Nov 11

Function. Introduction. 7.(1-3)

Nov 14

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

Nov 16

Map and filter; function properties; inverse functions; composition. 7.(5-8)

Nov 18

Cardinality. 7.9

Nov 21

No-credit quiz. Countability. 7.15

Nov 23

NO CLASS

Nov 25

NO CLASS

Nov 28

Review

Nov 30

TEST

Dec 2

Map and foldl; modeling functions. 7.(5 & 14)

Dec 5

Fixed-point iteration. 7.(12 & 13)

Dec 7

Huffman encoding. 6.12

Dec 9

Review