|
Reading Assignments and Suggested Exercises
Book: | Discrete Mathematics and Its Applications, 7th edition | Author: | Kenneth Rosen |
Section | Topic | Reading | Exercises | 1.1 | Propositional Logic | All | 1,3,5,9,11,13,15,17,21,25,27,29,33,37 |
1.2 | Applications of Propositional Logic | All | 1,3,5,7,9,17,39,41,43 |
1.3 | Propositional Equivalences | All but skim 32-33 | 1,5,7,9,11,13,15,17,21,29,41,59,61 |
1.4 | Predicates and Quantifiers | All | 1,3,5,7,9,11,13,19,21,25,35,39,43,45,51,55,57 |
1.6 | Rules of Inference | All | 1,3,7,9,15,17,19,23 |
1.7 | Introduction to Proofs | All | 1,3,5,9,15,17,23,31 |
1.8 | Proof Methods and Strategy | Pages 92-96 (stop at Existence Proofs) and 100-107 | 1,3,9,11,17,27,29,31 |
2.1 | Sets | All | 1,3,5,7,9,11,13,15,17,19,21,23,27,29,35,37 |
2.2 | Set Operations | All | 1,3,9,13,15,17,19,25,27,29,47,53,55, 57 |
2.3 | Functions | All | 1,3,7,9,12,13,15,17,19,37,39 |
2.4 | Sequences and Summations | All | 1,3,5,7,9,13,15,17,19,21,25,31,33,35,39 |
5.1 | Mathematical Induction | All | 3,5,11,13,19,31,49,50,51 |
5.2 | Strong Induction and Well-Ordering | All | 3,7,11 |
5.3 | Recursive Definitions and Structural Induction | All but skip Lame's Theorem/Proof and Generalized Induction | 1,3,5,7,9,13,15,23,25 |
6.1 | The Basics of Counting | All | 1,3,7,11,13,17,25,29,31,41,47,49,55,57,61 |
6.2 | The Pigeonhole Principle | All | 1,3,9,15,17,19,27,31,35,37 |
6.3 | Permutations and Combinations | All | 1,3,5,6,11,13,19,21,23,25,31,37 |
6.4 | Binomial Coefficients and Identities | All | 1,5,7,9,15,19,29 |
8.5 | Inclusion-Exclusion | All | 1,3,5,7,9,15 |
9.1 | Relations and Their Properties | All | 1,3,5,7,13,15,33,35,39,37 |
9.3 | Representing Relations | All | 1,3,5,6,7,11,13,14,15,19,21,27,31 |
9.5 | Equivalence Relations | All | 1,3,11,15,21,23,27,35,41,43 |
12.1 | Boolean Functions | All | 1,3,5,9,11,19,21,35 |
12.2 | Representing Boolean Functions | All | 1,3,5 |
|
|
|
|