CSE 235 Fall 2003
Introduction to Discrete Structures
Archived Class
Charles Cusack
Computer Science and Engineering
University of Nebraska--Lincoln
Main
Schedule
Grading
Gradebook
Assignments

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 112
CSCI 125
Others

Admin

Reading Assignments and Suggested Exercises

Book:Discrete Mathematics and Its Applications, 5th edition
Author: Kenneth Rosen
SectionTopicReadingExercises
1.1Logic1-151,3,5,7,11,13,19,21,25,40,41,42,60
1.2Propositional Equivalences20-261,5,9,12,13,17,21,28,51
1.3Predicates and Quantifiers28-401,3,5,10,13,19,21,26,29,37,41,43,55,57
1.4Nested Quantifiers44-511,3,5,9,11,17,27,33,35
1.5Methods of Proof56-731,3,5,9,15,17,19,21,23,26,28,33,40,42,70,77
1.6Sets77-851,3,5,7,13,17,18,19,21
1.7Set Operations86-941,3,11,13,14,17,22
1.8Functions97-1081,3,9,14,16,19,26,28,44,65
2.1Algorithms119-1293,5,17,20,24,29,31
2.2The Growth of Functions131-1421,3,5,7,9,14,17,21,24,31
2.3Complexity of Algorithms144-1513,4,5,17,19,27
2.4The Integers and Division153-1661,5,7,8,9,11,13,18,26,37,55,56,57
2.5Integers and Algorithms169-1791,3,8,21
2.6Applications of Number TheorySKIP
2.7MatricesSKIP
3.1Proof Strategy213-2231,3,5,7,10,16,20,25,27
3.2Sequences and Summations225-2331,3,5,13,15,17,19,23,27
3.3Mathematical Induction238-2533,4,5,8,13,14,21,31,48
3.4Recursive Definitions and Structural Induction256-2611,5,7,9
3.5Recursive Algorithms274-2831,6,7,13,24,29
3.6Program CorrectnessSKIP
4.1The Basics of Counting301-3101,3,5,7,11,13,17,18,21,28,29,44,55
4.2The Pigeonhole Principle313-3181,3,9,17,19,24,37
4.3Permutations and Combinations320-3241,3,5,6,11,13,18,21,25,31
4.4Binomial Coefficients327-3311,3,4,7,12,20
4.5Generalized Permutations and Combinations335-3411,5,7,9,15,24,31,35,50
4.6Generating Permutations and CombinationsSKIP
6.1Recurrence Relations401-4081,3,5,7,9,13,19,25,49,50,51,52
6.2Solving Recurrence RelationsSKIP
6.3Divide-and-Conquer Algorithms and Recurrence Relations425-43310,11,12,13,17,19
6.4Generating FunctionsSKIP
6.5Inclusion-Exclusion451-4551,3,5,7,8,9,12,15
6.6Applications to Inclusion-Exclusion457-4641,2,6,9,12,14,21,25
7.1Relations and Their Properties471-4791,3,5,6,7,8,33,35,38,48,49,53
7.2n-ary Relations and Their ApplicationsSKIP
7.3Representing Relations489-4941,3,5,6,7,9,11,14,18,20,27,28,31
7.4Closures of Relations496-5061,3,5,7,9,16,19,25,27
7.5Equivalence Relations507-5121,2,3,4,9,13,17,18,20,26,29,31,33
7.6Partial Orderings516-5271,3,4,8,11,12,17,26,29,59
8.1Introduction to Graphs537-5431,3,5,7,8,9,14,20
8.2Graph Terminology545-5541,3,5,7,9,15,18,21,23,24,25,28
8.3Representing Graphs and Graph Isomorphism557-5631,3,4,6,7,9,12,14,19,21,30,35,39,42,43,44,55
8.4Connectivity567-5731,3,5,7,12
8.5Euler and Hamiltonian Paths577-5881,3,4,5,6,8,9,10,14,18,19,22,26,32,34,40,56,59
8.6Shortest-Path ProblemsSKIP
8.7Planar GraphsSKIP
8.8Graph ColoringSKIP
9.1Intoduction to Trees631-6411,3,4,9,16,21,22
9.2Applications of Trees644-6561,2,3,4,5,6,7,19,20,21,23,27
9.3Tree Traversal660-6727,8,9,11,12,13,16,18,22
9.4Spanning TreesSKIP
9.5Minimum Spanning TreesSKIP