# CIS166.002 - Tentative Schedule and Homework Assignments

 Section Topic Problems Due date 7.1 Relations and their Properties 3, 7, 9, 16, 28 9/3 7.3 Representing Relations 1, 3, 7, 13, 14, 15, 22, 26, 31 9/3 7.4 Closures of Relations 6, 11, 16, 17, 18, 25, 26-29 9/10 8.1 Introduction to Graphs 3-10 9/10 8.2 Graph Terminology 2, 4, 7, 8, 9, 10, 18, 20, 21, 22, 23, 26, 29-33 9/17 8.3 Representing Graphs 2, 3, 4, 7, 10, 12, 14-17, 20, 21, 24, 26, 50, 55, 57, 58, 61-64 9/17 8.4 Connectivity 2-5, 18, 19, 23-25, 26 9/24 8.6 Shortest Path 2-8, 10, 12, 17 10/1 9.1 Introduction to Trees 17-20, 27, 28 10/1 9.2 Applications of Trees 1-5, 19, 21 10/8 9.3 Tree Traversal 1-4, 6-17, 23, 24, 30 10/8 9.4 Spanning Trees 2-10, 13-16, 30 10/15 9.5 Minimum Spanning Trees 2-9, 12-15 10/15 6.1 Recurrence relations 1, 10, 17, 22, 32, 41, 46 10/29 6.2 Solving Recurrence relations 1, 12, 17, 23, 29, 34 10/29 6.5 Inclusion-Exclusion 5, 6, 7, 8, 23, 25 11/5 7.5 Equivalence Relations 1-4, 8, 9, 15-23, 28, 29, 32, 37, 40, 47, 48 11/5 7.6 Partial Orderings 1-5, 8, 11-14, 21-27, 31, 32 11/12 10.1 Boolean Functions 11, 22, 23, 25, 26 11/12 10.2 Representing Boolean Functions 1-4 11/19 10.3 Logic Gates 1-6, 8, 9 11/19 10.4 Minimization of Circuits 2, 3, 4, 7, 8, 12, 14, 15, 23, 25, 30 11/19 11.1 Languages and Grammars 1, 2, 3, 5-7, 13, 16, 17-19, 22 11/24 11.2 Finite State Machines with Output 1-4, 7 12/3 11.3 Finite State Machines with No Output 5, 9, 10, 13, 14, 16, 18, 19 12/3 11.4 Language recognition 1-4, 6, 7, 9-11 12/7