Section

Topic

Problems

Class date

Course overview

Jan. 20

8.3

Representing Relations

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

Jan. 22

8.4

Closures of Relations

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

Jan. 27

8.5

Equivalence Relations

8, 15, 21, 30, 47

Jan. 29

8.6

Partial Orderings

8, 9, 22, 32, 44, 62

Feb. 3

9.1

Introduction to Graphs

3, 5, 7, 10

Feb. 5

* snow fun *

Feb. 10

9.2

Graph Terminology

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

Feb. 12

9.3

Representing Graphs

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

Feb. 17

9.4

Connectivity

2-5, 17- 19, 24-25

Feb. 19

9.5

Euler and Hamilton Paths

1, 2, 10, 18, 28, 30, 31, 32, 50, 54

Feb. 24

* snow again *

Feb. 26

9.6

Shortest Path

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

Mar. 3

9.7

Planar Graphs

2, 4, 6, 8, 12, 14, 16

Mar. 5

9.8

Graph Coloring

2, 4, 6, 10, 18, 20

Mar. 17

Review, Matching in Graphs

Mar. 19

Midterm exam (8.3 - 9.8)

(during Recitation)

Mar. 22

Midterm discussion

Mar. 24

10.1

Introduction to Trees

17-20, 27, 28

Mar. 26

10.2

Applications of Trees

1-5, 19,  21, 24

Mar. 31

10.3

Tree Traversal

1-4, 6-17, 23, 24

Apr. 2

10.4

Spanning Trees

2-10, 13-16, 30

Apr. 7

10.5

Minimum Spanning Trees

2-9, 12-15

Apr. 9

12.1

Languages and Grammars

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

Apr. 14

12.2

Finite State Machines with Output

1-4, 7

Apr. 16

12.3

Finite State Machines with No Output

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

Apr. 21

12.4

Language recognition

1-4, 6, 8-10

Apr. 23

12.5

Turing Machine

1-5, 12

Apr. 28

Review

Apr. 30

Final Exam

Time 1:00 to 3:00 PM  in  TL305A

May 7