Computer Science 243

Discrete Mathematics and Functional Programming
Fall 2025
Thomas VanDrunen



Meeting time: MWF 2:15-3:25 pm.
Meeting place: Meyer 131

Office hours: Drop-in 3:30-4:30 MWF; also schedule through Calendly
Contact: Meyer 163 Science; 630-752-5692; Thomas.VanDrunen@wheaton.edu
http://cs.wheaton.edu/~tvandrun/cs243


Syllabus



Final exam: Tuesday, Dec 16, 1:30 pm


Moon's dayWoden' s dayFrigga's day

Aug 25

NO CLASS

Aug 27

Sets. From numbers to sets. 1.1
Slides

Aug 29

Python expressions (in lab). 1.(2&3)

Sept 1

NO CLASS

Sept 3

Python functions; denoting sets. 1.(3&4)

Sept 5

Set operations; visual verification. 1.(5&6)

Sept 8

Various set topics; powersets. 1.(7&8)

Sept 10

Sequence. Sequences and lists. 2.1

Sept 12

Recursion. 2.2

Sept 15

Functions on lists. 2.3

Sept 17

More functions on lists; sorting. 2.3

Sept 19

Arrays. 2.4

Sept 22

Review

Sept 24

TEST

Sept 26

Proposition. Logical equivalence. 3.1

Sept 29

Boolean sequences. 3.2

Oct 1

Conditional propositions and arguments. 3.3

Oct 3

Predicates and quantification. 3.(4&5)

Oct 6

Proof. Subset proofs. 4.1

Oct 8

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

Oct 10

Conditional and number-theory proofs. 4.(4&5)

Oct 13

Powerset proofs. 4.7

Oct 15

Review

Oct 17

TEST

Oct 20

NO CLASS

Oct 22

NO CLASS

Oct 24

Relation. Relation definitions. 5.(1&2)

Oct 27

Images and composition; relation properties 5.(2&3)

Oct 29

Relation proofs. 5.3

Oct 31

Closures. 5.4

Nov 3

Partial and total orders. 5.5

Nov 5

Function. Function definitions. 6.1

Nov 7

Images and inverse images. 6.2

Nov 10

Function properties and composition. 6.(3&4)

Nov 12

Reducing and pipelining. 6.5

Nov 14

Cardinality. 6.6

Nov 17

Countability. 6.7

Nov 19

Review

Nov 21

TEST

Nov 24

Self reference. Recursivly-defined sets. 7.1

Nov 26

NO CLASS

Nov 28

NO CLASS

Dec 1

Trees. 7.2

Dec 3

Structural induction. 7.4

Dec 5

Mathematical induction. 7.5

Dec 8

Loops 7.6

Dec 10

Loop invariants. 7.7

Dec 12

Review