Synopses & Reviews
This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.
* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals
* Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations
* Weaves numerous applications into the text
* Helps students learn by doing with a wealth of examples and exercises:
- 560 examples worked out in detail
- More than 3,700 exercises
- More than 150 computer assignments
- More than 600 writing projects
* Includes chapter summaries of important vocabulary, formulas, and properties, plus the chapter review exercises
* Features interesting anecdotes and biographies of 60 mathematicians and computer scientists
* Instructor's Manual available for adopters
* Student Solutions Manual available separately for purchase (
Synopsis
Discrete math is the mathematics of distinct and discrete objects, such as the positive integers. Digital computers are designed to process the discrete objects 0 and 1, whereas analog computers are designed to deal with continuous data. Accordingly, discrete math has been developed to study and employ the power of math to digital computer systems, to appreciate its beauty, and to communicate with ease the language of discrete math.
This approachable text provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.
_ Self-contained, well-organized, student-oriented, and non-intimidating style.
_ Attractive and well-balanced mix of conversational and formal writing style.
_ Numerous relevant applications woven into the mainstream of the text.
_ A generous selection of well-chosen examples and exercises.
Synopsis
This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.
Table of Contents
Preface: A Word to the Student; 1. The Language of Logic; 2. The Language of Sets; 3. Functions and Matrices; 4. Induction and Algorithms; 5. Recursion; 6. Combinatorics and Discrete Probability; 7. Relations; 8. Graphs; 9. Trees; 10. Digraphs; 11. Formal Languages and Finite-State Machines; 12. Boolean Algebra and Combinatorial Circuits; Appendix; Bibliography; Solutions to Odd Numbered Exercises; Index.