? Language used is easy to understand. ? Comprehensive coverage of Induction, Recursion, and Counting. ? Algorithms in the text are given using pseudocodes. ? Applications included, demonstrate the utility of the subject in terms of Real-World problems. Pedagogical Features: ? 2992 Exercise Problems ? 195 Review Questions ? 480 Supplementary Exercises ? 152 Computer Projects ? 93 Computations & Explorations ? 140 Writing Projects New to the Edition: ? A separate chapter on Discrete Structures (Chapter 2) ? The new chapter 4 on Induction and Recursion. ? Conditional Statements & De Morgan?s Laws receive expanded coverage. ? Material on Valid Arguments and Rules of Inference is presented in a separate section. ? Coverage of Turing Machines expanded. ? Over 400 new exercises and several new examples have been added. ? The introduction of Basic Counting Techniques, and Permutations and Combinations enhanced
Table of Contents:
Chapter 1: The Foundations: Logic and Proofs
Chapter 2: Basic Structures: Sets, Functions, Sequences and Sums
Chapter 3: The Fundamentals: Algorithms, the Integers, and Matrices
Chapter 4: Induction and Recursion
Chapter 5: Counting
Chapter 6: Advanced Counting Techniques
Chapter 7: Relations
Chapter 8: Graphs
Chapter 9: Trees
Chapter 10: Boolean Algebra
Chapter 11 :Modeling Computation
Appendices
Appendix 1: Axioms for the Real Numbers and the Positive Integers
Appendix 2: Exponential and Logarithmic Functions
Appendix 3 :Pseudocode
Social Networks