Section

Topic

Problems

Class date

7.1

Relations and their Properties

3, 7, 9, 16, 28

Aug. 30

7.1,7.2

Binary and n-ary Relations

(7.1): 24, 25, 26, 27, 34; (7.2): 9-11

Sep. 1

7.3

Representing Relations

1, 3, 7, 13, 14, 15, 22, 26, 31

Sep. 6

7.4

Closures of Relations

6, 11, 16, 17, 18, 25, 26-29

Sep. 8

7.4

Closures of Relations

Sep. 13

7.5

Equivalence Relations

1-4, 8, 9, 15-23, 28, 29, 32, 37, 40, 47, 48

Sep. 15

7.6

Partial Orderings

1-5, 8, 11-14, 21-27, 31, 32

Sep. 20

8.1

Introduction to Graphs

3-10

Sep. 22

8.2

Graph Terminology

2, 4, 7, 8, 9, 10, 18, 20, 21, 22, 23, 26, 29-33

Sep. 27

8.3

Representing Graphs

2, 3, 4, 7, 10, 12, 14-17, 20, 21, 24, 26, 50, 55, 57, 58, 61-64

Sep. 29

8.4

Connectivity

2-5, 18, 19, 23-25, 26

Oct. 4 

8.6

Shortest Path

2-8, 10, 12, 17

Oct. 6

9.1

Introduction to Trees

17-20, 27, 28

Oct. 11

9.2

Applications of Trees

1-5, 19, 21

Oct. 13

9.3

Tree Traversal

1-4, 6-17, 23, 24, 30

Oct. 18

9.4

Spanning Trees

2-10, 13-16, 30

Oct. 20

9.5

Minimum Spanning Trees

2-9, 12-15

Oct. 25

Repetition

Oct. 27

Midterm exam (during Recitation)

Oct. 31

10.1

Boolean Functions

11, 22, 23, 25, 26

Nov. 1

10.2

Representing Boolean Functions

1-4

Nov. 3

Midterm exam discussion

Nov. 8

10.3

Logic Gates

1-6, 8, 9

Nov. 10

11.1

Languages and Grammars

1, 2, 3, 5-7, 16, 17-19, 22

Nov. 15

11.2

Finite State Machines with Output

13 (from 11.1), 1-4, 7

Nov. 17

11.3

Finite State Machines with No Output

1, 5, 9, 10, 13, 14, 16, 18, 19

Nov. 22

(Thanksgiving recess)

Nov. 24

11.4

Language recognition

1-4, 6, 9-11

Nov. 29

11.5

Turing Machine

1-5, 12

Dec. 1

Repetition

Dec. 6

Final Exam

Friday, 2:00 - 4:00 p.m.

Dec. 16