|
|
Reading Assignments and Suggested Exercises
| Book: | Discrete Mathematics and Its Applications, 6th edition | | Author: | Kenneth Rosen |
| Section | Topic | Reading | Exercises | | 1 | REVIEW | Key Terms and Results | Review Questions: 3,4,6,7,9,10,11,13,14
Supplementary Exercises: 11 |
| 1.1 | Propositional Logic | 1-16 | 1,3,5,9,11,13,15,17,21,25,27,29,33,37,45,49,51 |
| 1.2 | Propositional Equivalences | 21-27 | 1,5,9,11,13,15,17,21,41 |
| 1.3 | Predicates and Quantifiers | 30-46 | 1,3,5,9,11,13,19,21,25,35,39,59,61 |
| 1.5 | Rules of Inference | 63-72 | 1,3,5,7,9,13,17,19,23 |
| 1.6 | Introduction to Proofs | 75-85 | 1,3,5,15,21,27 |
| 1.7 | Proof Methods and Strategy | 86-102 | 1,3,7,9,17,25,27,29,31 |
| 2 | REVIEW | Key Terms and Results | Review Questions: 3,4,5,6,8,9,10,11
Supplementary Questions: 298 |
| 2.1 | Sets | 111-119 | 1,3,5,7,11,13,15,17,19,21,23,29 |
| 2.2 | Set Operations | 121-130 | 1,3,9,11,15,17,19,25,27,29,47 |
| 2.3 | Functions | 133-146 | 1,3,7,9,12,13,15,17,19,32,33,55,57 |
| 2.4 | Sequences and Summations | 149-160 | 1,3,5,7,9,13,15,17,19,23,27 |
| 3 | REVIEW | Key Terms and Results | Review Questions: 10,11,12,13 |
| 3.1 | Algorithms | 167-177 | None |
| 3.2 | The Growth of Functions | 180-184 | None |
| 3.3 | Complexity of Algorithms | 193-199 | 1, 3, 7, 9, 10 |
| 3.4 | The Integers and Division | 200-208 | 1, 3, 5, 7, 9, 11, 17, 21, 31b |
| 3.5 | Primes and Greatest Common Divisors | 210-217 | 1, 3, 5, 7, 9, 11, 13, 15, 21, 33 |
| 3.7 | Applications of Number Theory | 231-244 | 1, 3, 5, 11, 19, 25 |
| 3.8 | Matrices | 246-252 (Stop at "Zero-One Matrices") | 1, 3, 5, 11, 15, 25 |
| 4 | REVIEW | Key Terms and Results | Supplementary Exercises: 1,7,17,41,43 |
| 4.1 | Mathematical Induction | 263-279 | 3,5,11,13,19,21,31,47,48,49 |
| 4.3 | Recursive Definitions and Structural Induction | 294-303 | 1,3,5,7,9,25,37 |
| 5 | REVIEW | Key Terms and Results | Review Questions: 6,8 |
| 5.1 | The Basics of Counting | 335-344 | 1,3,7,11,13,17,29,31,39,43,49 |
| 5.2 | The Pigeonhole Principle | 347-353 | 1,3,9,15,17,19,24,33 |
| 5.3 | Permutations and Combinations | 355-360 | 1,3,5,6,11,13,19,21,25,31,41 |
| 5.4 | Binomial Coefficients | 363-368 | 1, 5, 7, 9, 15 |
| 6 | REVIEW | Key Terms and Results | Review Questions: 1,2
Supplementary Exercises: 1,3 |
| 7.1 | Recurrence Relations | 449-456 | 1,3,5,9,11,17,35,49,50,51,52 |
| 7.3 | Divide-and-Conquer Algorithms and Recurrence Relations | 474-482 | 1,7,9,11,13,15 |
| 8 | REVIEW | Key Terms and Results | Review Questions: 1,2,3,6,7,10,13
Supplementary Exercises: 14 |
| 8.1 | Relations and Their Properties | 519-527 | 1,3,5,7,13,15,33,35,39,47 |
| 8.3 | Representing Relations | 537-542 | 1,3,5,6,7,9,11,13,14,15,19,21,27,31 |
| 8.5 | Equivalence Relations | 555-562 | 1,3,4,9,11,17,21,23,27,35,41,43 |
| 11 | REVIEW | Key Terms and Results | Review Questions: 5,6,9,10
Supplementary Exercises: 18 |
| 11.1 | Boolean Functions | 749-755 | 1,3,5,9,15,19,21,27 |
| 11.2 | Representing Boolean Functions | 757-759 | 1,3,5,13,15 |
| 11.3 | Logic Gates | 760-765 | 1,3,5,7,9,15 |
| 11.4 | Minimization of Circuits | 766-775 | 1,3,5,6,7,17 |
|
|
|
|