Section

Topic

Problems

Class date

7.1

Relations and their Properties

3, 7, 9, 16, 28

Aug. 29

7.1,7.2

Binary and n-ary Relations

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

Aug. 31

7.3

Representing Relations

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

Sep. 5

7.4

Closures of Relations

6, 11, 16, 17, 18,

Sep. 7

7.4

Closures of Relations

25, 26-29

Sep. 12

7.5

Equivalence Relations

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

Sep. 14

7.6

Partial Orderings

1-5, 8, 11-14, 21, 26-27, 55, 58, 59

Sep. 19

8.1

Introduction to Graphs

3-10

Sep. 21

8.2

Graph Terminology

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

Sep. 26

8.3

Representing Graphs

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

Sep. 28

8.4

Connectivity

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

Oct. 3

8.6

Shortest Path

2-8, 10, 12, 17

Oct. 5

9.1

Introduction to Trees

17-20, 27, 28

Oct. 10

9.2

Applications of Trees

1-5, 19,  21, 24

Oct. 12

9.3

Tree Traversal

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

Oct. 17

9.4

Spanning Trees

2-10, 13-16, 30

Oct. 19

9.5

Minimum Spanning Trees

2-9, 12-15

Oct. 24

Repetition

Oct. 26

Midterm exam (7.1 - 9.3)

(during Recitation)

Oct. 27

10.1

Boolean Functions

11, 22, 23, 25, 26

Oct. 31

Midterm exam discussion

Nov. 2

10.2

Representing Boolean Functions

1-4

Nov. 7

10.3

Logic Gates

1-6, 8, 9

Nov. 9

11.1

Languages and Grammars

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

Nov. 14

11.2

Finite State Machines with Output

13 (from 11.1), 1-4, 7

Nov. 16

11.3

Finite State Machines with No Output

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

Nov. 21

11.4

Language recognition

1-4, 6, 9-11

Nov. 28

11.5

Turing Machine

1-5, 12

Nov. 30

Repetition

Dec. 5

Final Exam

Time

??