Description
This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study.
Features
This text has an enhanced mathematical approach, with carefully thought out examples, including many examples with computer sciences applications
Historical reviews and biographies bring a human element to their assignments
Chapter summaries allow students to review what they have learned
Expanded treatment of discrete probability in Chapter 3;
New material on cryptology, private-key cryptosystems in Chapter 14; public-key RSA cryptosystems in Chapter 16
Table of Contents
1. Fundamental Principles of Counting
2. Fundamentals of Logic
3. Set Theory
4. Properties of the Integers: Mathematical Induction
5. Relations and Functions
6. Languages: Finite State Machines
7. Relations: The Second Time Around
8. The Principle of Inclusion and Exclusion
9. Generating Functions
11. An Introduction to Graph Theory
12. Trees.
13. Optimization and Matching
14. Rings and Modular Arithmetic
15. Boolean Algebra and Switching Functions
16. Groups, Coding Theory, and Polya's Theory of Enumeration