Section

Topic

Problems

Class date

8.1, 8.2

Binary and n-ary Relations

(8.1): 24, 25, 26, 27, 28, 34; (8.2): 9-11

Jan. 21

8.3

Representing Relations

2, 4, 8, 14, 15, 19, 27

Jan. 26

8.4

Closures of Relations

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

Jan. 28

8.5

Equivalence Relations

8, 15, 21, 30, 47

Feb. 2

8.6

Partial Orderings

8, 9, 22, 32, 44, 62

Feb. 4

9.1

Introduction to Graphs

3, 5, 7, 10

Feb. 9

9.2

Graph Terminology

1-5, 7-10, 18, 20- 23, 26, 29-31

Feb. 11

9.3

Representing Graphs

2, 6, 12, 14, 17, 20, 24, 26, 34, 36, 55, 57,  61, 64

Feb. 16

9.4

Connectivity

2-5, 17- 19, 24-25

Feb. 18

9.6

Shortest Path

2, 3, 6, 8, 10, 12, 17

Feb. 23

10.1

Introduction to Trees

17-20, 27, 28

Feb. 25

10.2

Applications of Trees

1-5, 19,  21, 24

Mar. 2

10.3

Tree Traversal

1-4, 6-17, 23, 24

Mar. 4

10.4

Spanning Trees

2-10, 13-16, 30

Mar. 16

10.5

Minimum Spanning Trees

2-9, 12-15

Mar. 18

Review

Mar. 23

Review

Mar. 25

Midterm exam (8.3 - 10.5)

(during Recitation)

Mar. 27

6.1

Discrete Probability

24, 35, 36, 38

Mar. 30

Midterm exam discussion

Apr. 1

6.2

Probability Theory

6, 23, 25, 27, 28, 34

Apr. 6

6.3

Probability Theory (Bayes' Rule)

1-6, 14, 16, 18

Apr. 8

6.4

Probability Theory

1-8, 16, 23, 24

Apr. 13

12.1

Languages and Grammars

1-3, 5, 7, 11, 13, 18-20

Apr. 15

12.2

Finite State Machines with Output

1-4, 7

Apr. 20

12.3

Finite State Machines with No Output

1, 5, 9, 10, 13, 16, 18, 24, 26

Apr. 22

12.4

Language recognition

1-4, 6, 8-10

Apr. 27

12.5

Turing Machine

1-5, 12

Apr. 29

Review

May 4 

Final Exam

Time 11:30 AM -1:30 PM  in  TL305A

May 11