CSE 235 Fall 2003 Introduction to Discrete Structures Archived Class Charles CusackComputer Science and EngineeringUniversity of Nebraska--Lincoln

# Reading Assignments and Suggested Exercises

 Book: Discrete Mathematics and Its Applications, 5th edition Author: Kenneth Rosen
 Section Topic Reading Exercises 1.1 Logic 1-15 1,3,5,7,11,13,19,21,25,40,41,42,60 1.2 Propositional Equivalences 20-26 1,5,9,12,13,17,21,28,51 1.3 Predicates and Quantifiers 28-40 1,3,5,10,13,19,21,26,29,37,41,43,55,57 1.4 Nested Quantifiers 44-51 1,3,5,9,11,17,27,33,35 1.5 Methods of Proof 56-73 1,3,5,9,15,17,19,21,23,26,28,33,40,42,70,77 1.6 Sets 77-85 1,3,5,7,13,17,18,19,21 1.7 Set Operations 86-94 1,3,11,13,14,17,22 1.8 Functions 97-108 1,3,9,14,16,19,26,28,44,65 2.1 Algorithms 119-129 3,5,17,20,24,29,31 2.2 The Growth of Functions 131-142 1,3,5,7,9,14,17,21,24,31 2.3 Complexity of Algorithms 144-151 3,4,5,17,19,27 2.4 The Integers and Division 153-166 1,5,7,8,9,11,13,18,26,37,55,56,57 2.5 Integers and Algorithms 169-179 1,3,8,21 2.6 Applications of Number Theory SKIP 2.7 Matrices SKIP 3.1 Proof Strategy 213-223 1,3,5,7,10,16,20,25,27 3.2 Sequences and Summations 225-233 1,3,5,13,15,17,19,23,27 3.3 Mathematical Induction 238-253 3,4,5,8,13,14,21,31,48 3.4 Recursive Definitions and Structural Induction 256-261 1,5,7,9 3.5 Recursive Algorithms 274-283 1,6,7,13,24,29 3.6 Program Correctness SKIP 4.1 The Basics of Counting 301-310 1,3,5,7,11,13,17,18,21,28,29,44,55 4.2 The Pigeonhole Principle 313-318 1,3,9,17,19,24,37 4.3 Permutations and Combinations 320-324 1,3,5,6,11,13,18,21,25,31 4.4 Binomial Coefficients 327-331 1,3,4,7,12,20 4.5 Generalized Permutations and Combinations 335-341 1,5,7,9,15,24,31,35,50 4.6 Generating Permutations and Combinations SKIP 6.1 Recurrence Relations 401-408 1,3,5,7,9,13,19,25,49,50,51,52 6.2 Solving Recurrence Relations SKIP 6.3 Divide-and-Conquer Algorithms and Recurrence Relations 425-433 10,11,12,13,17,19 6.4 Generating Functions SKIP 6.5 Inclusion-Exclusion 451-455 1,3,5,7,8,9,12,15 6.6 Applications to Inclusion-Exclusion 457-464 1,2,6,9,12,14,21,25 7.1 Relations and Their Properties 471-479 1,3,5,6,7,8,33,35,38,48,49,53 7.2 n-ary Relations and Their Applications SKIP 7.3 Representing Relations 489-494 1,3,5,6,7,9,11,14,18,20,27,28,31 7.4 Closures of Relations 496-506 1,3,5,7,9,16,19,25,27 7.5 Equivalence Relations 507-512 1,2,3,4,9,13,17,18,20,26,29,31,33 7.6 Partial Orderings 516-527 1,3,4,8,11,12,17,26,29,59 8.1 Introduction to Graphs 537-543 1,3,5,7,8,9,14,20 8.2 Graph Terminology 545-554 1,3,5,7,9,15,18,21,23,24,25,28 8.3 Representing Graphs and Graph Isomorphism 557-563 1,3,4,6,7,9,12,14,19,21,30,35,39,42,43,44,55 8.4 Connectivity 567-573 1,3,5,7,12 8.5 Euler and Hamiltonian Paths 577-588 1,3,4,5,6,8,9,10,14,18,19,22,26,32,34,40,56,59 8.6 Shortest-Path Problems SKIP 8.7 Planar Graphs SKIP 8.8 Graph Coloring SKIP 9.1 Intoduction to Trees 631-641 1,3,4,9,16,21,22 9.2 Applications of Trees 644-656 1,2,3,4,5,6,7,19,20,21,23,27 9.3 Tree Traversal 660-672 7,8,9,11,12,13,16,18,22 9.4 Spanning Trees SKIP 9.5 Minimum Spanning Trees SKIP