Section

Topic

Problems

Due date

7.1

Relations and their Properties

3, 7, 9, 16, 28

Fri  Jan 21

7.3

Representing Relations

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

Tue Jan 25

7.4

Closures of Relations

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

Fri   Jan 28

8.1

Introduction to Graphs

3-10

Tue Feb 1

8.2

Graph Terminology

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

Fri   Feb 4

8.3

Representing Graphs

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

Tue Feb 8

8.4

Connectivity

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

Fri  Feb 11

8.6

Shortest Path

2-8, 10, 12, 17

Fri  Feb 11

9.1

Introduction to Trees

17-20, 27, 28

Fri  Feb 18

9.2

Applications of Trees

1-5, 19, 21

Fri  Feb 18

9.3

Tree Traversal

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

Fri  Feb 25

9.4

Spanning Trees

2-10, 13-16, 30

Fri  Feb 25

9.5

Minimum Spanning Trees

2-9, 12-15

Fri  Mar 4

Mar. 3

Repetition

(spring break)

6.1

Recurrence relations

1, 10, 17, 22, 32, 41, 46

Fri  Mar 18

Mar. 17

Midterm exam

6.2

Solving Recurrence relations

1, 12, 17, 23, 29, 34

Fri   Mar 25

6.5

Inclusion-Exclusion

5, 6, 7, 8, 23, 25

Fri Mar 25

7.5

Equivalence Relations

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

Fri April 1

7.6

Partial Orderings

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

Fri April 1

10.1

Boolean Functions

11, 22, 23, 25, 26

Fri April 8

10.2

Representing Boolean Functions

1-4

Fri April 8

10.3

Logic Gates

1-6, 8, 9

Fri April 15

11.1

Languages and Grammars

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

Fri April 15

11.2

Finite State Machines with Output

13 (from 11.1), 1-4, 7

Fri April 22

11.3

Finite State Machines with No Output

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

Fri April 22

11.4

Language recognition

1-4, 6, 7, 9-11

Fri April 29

11.5

Turing Machine,
Repetition

1-5, 12, 20

(class ends this week)

May 11

Final Exam