CSCI 250 Spring 2011
Discrete Structures
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 112
CSCI 125
Others

Admin

Reading Assignments and Suggested Exercises

Book:Discrete Mathematics and Its Applications, 6th edition
Author: Kenneth Rosen
SectionTopicReadingExercises
1REVIEWKey Terms and ResultsReview Questions: 3,4,6,7,9,10,11,13,14
Supplementary Exercises: 11
1.1Propositional Logic1-161,3,5,9,11,13,15,17,21,25,27,29,33,37,45,49,51
1.2Propositional Equivalences21-271,5,9,11,13,15,17,21,41
1.3Predicates and Quantifiers30-461,3,5,9,11,13,19,21,25,35,39,59,61
1.5Rules of Inference63-721,3,5,7,9,13,17,19,23
1.6Introduction to Proofs75-851,3,5,15,21,27
1.7Proof Methods and Strategy86-1021,3,7,9,17,25,27,29,31
2REVIEWKey Terms and ResultsReview Questions: 3,4,5,6,8,9,10,11
Supplementary Questions: 298
2.1Sets111-1191,3,5,7,11,13,15,17,19,21,23,29
2.2Set Operations121-1301,3,9,11,15,17,19,25,27,29,47
2.3Functions133-1461,3,7,9,12,13,15,17,19,32,33,55,57
2.4Sequences and Summations149-1601,3,5,7,9,13,15,17,19,23,27
3REVIEWKey Terms and ResultsReview Questions: 10,11,12,13
3.1Algorithms167-177None
3.2The Growth of Functions180-184None
3.3Complexity of Algorithms193-1991, 3, 7, 9, 10
3.4The Integers and Division200-2081, 3, 5, 7, 9, 11, 17, 21, 31b
3.5Primes and Greatest Common Divisors210-2171, 3, 5, 7, 9, 11, 13, 15, 21, 33
3.7Applications of Number Theory231-2441, 3, 5, 11, 19, 25
3.8Matrices246-252 (Stop at "Zero-One Matrices")1, 3, 5, 11, 15, 25
4REVIEWKey Terms and ResultsSupplementary Exercises: 1,7,17,41,43
4.1Mathematical Induction263-2793,5,11,13,19,21,31,47,48,49
4.3Recursive Definitions and Structural Induction294-3031,3,5,7,9,25,37
5REVIEWKey Terms and ResultsReview Questions: 6,8
5.1The Basics of Counting335-3441,3,7,11,13,17,29,31,39,43,49
5.2The Pigeonhole Principle347-3531,3,9,15,17,19,24,33
5.3Permutations and Combinations355-3601,3,5,6,11,13,19,21,25,31,41
5.4Binomial Coefficients363-3681, 5, 7, 9, 15
6REVIEWKey Terms and ResultsReview Questions: 1,2
Supplementary Exercises: 1,3
7.1Recurrence Relations449-4561,3,5,9,11,17,35,49,50,51,52
7.3Divide-and-Conquer Algorithms and Recurrence Relations474-4821,7,9,11,13,15
8REVIEWKey Terms and ResultsReview Questions: 1,2,3,6,7,10,13
Supplementary Exercises: 14
8.1Relations and Their Properties519-5271,3,5,7,13,15,33,35,39,47
8.3Representing Relations537-5421,3,5,6,7,9,11,13,14,15,19,21,27,31
8.5Equivalence Relations555-5621,3,4,9,11,17,21,23,27,35,41,43
11REVIEWKey Terms and ResultsReview Questions: 5,6,9,10
Supplementary Exercises: 18
11.1Boolean Functions749-7551,3,5,9,15,19,21,27
11.2Representing Boolean Functions757-7591,3,5,13,15
11.3Logic Gates760-7651,3,5,7,9,15
11.4Minimization of Circuits766-7751,3,5,6,7,17