Section

Topic

Problems

Class date

7.1

Relations and their Properties

3, 7, 9, 16, 28

Jan. 17

7.1,7.2

Binary and n-ary Relations

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

Jan. 22

7.3

Representing Relations

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

Jan. 24

7.4

Closures of Relations

6, 11, 16, 17, 18,

Jan. 29

7.4

Closures of Relations

25, 26, 29

Jan. 31

7.5

Equivalence Relations

1-4, 8, 9, 15-17, 19-23, 29, 32, 37, 45

Feb. 5

7.6

Partial Orderings

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

Feb. 7

8.1

Introduction to Graphs

3-10

Feb. 12

8.2

Graph Terminology

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

Feb. 14

8.3

Representing Graphs

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

Feb. 19

8.4

Connectivity

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

Feb. 21

8.6

Shortest Path

2-8, 10, 12, 17

Feb. 26

9.1

Introduction to Trees

17-20, 27, 28

Feb. 28

9.2

Applications of Trees

1-5, 19,  21, 24

Mar. 12

9.3

Tree Traversal

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

Mar. 14

9.4

Spanning Trees

2-10, 13-16, 30

Mar. 19

9.5

Minimum Spanning Trees

2-9, 12-15

Mar. 21

Repetition

Mar. 26

10.1

Boolean Functions

11, 22, 23, 25, 26

Mar. 28

Midterm exam (7.1 - 9.3)

(during Recitation)

Mar. 30

Midterm exam discussion

Apr. 2

10.2

Representing Boolean Functions

1-4

Apr. 4

10.3

Logic Gates

1-6, 8, 9

Apr. 9

11.1

Languages and Grammars

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

Apr. 11

11.2

Finite State Machines with Output

13 (from 11.1), 1-4, 7

Apr. 16

11.3

Finite State Machines with No Output

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

Apr. 18

11.4

Language recognition

1-4, 6, 9-11

Apr. 23

11.5

Turing Machine

1-5, 12

Apr. 25

Repetition

Apr. 30

Final Exam

Time 2:00-4:00 PM, in  BB00107

May. 9