Discrete and Combinatorial Mathematics: An Applied Introduction 5/e (絕)
- 20本以上，享 8.5折
售價
$
洽詢
- 一般書籍
- ISBN：9780321211033
- 作者：Ralph Grimaldi
- 版次：5
- 年份：2004
- 出版商：Pearson Education
- 頁數/規格：1016頁/平裝雙色
書籍介紹
本書特色
目錄
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.
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
PART 1. FUNDAMENTALS OF DISCRETE MATHEMATICS
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
PART 2. FURTHER TOPICS IN ENUMERATION
8. The Principle of Inclusion and Exclusion
9. Generating Functions
PART 3. GRAPH THEORY AND APPLICATIONS
11. An Introduction to Graph Theory
12. Trees.
13. Optimization and Matching
PART 4. MODERN APPLIED ALGEBRA
14. Rings and Modular Arithmetic
15. Boolean Algebra and Switching Functions
16. Groups, Coding Theory, and Polya's Theory of Enumeration
17. Finite Fields and Combinatorial Designs.
PART 1. FUNDAMENTALS OF DISCRETE MATHEMATICS
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
PART 2. FURTHER TOPICS IN ENUMERATION
8. The Principle of Inclusion and Exclusion
9. Generating Functions
PART 3. GRAPH THEORY AND APPLICATIONS
11. An Introduction to Graph Theory
12. Trees.
13. Optimization and Matching
PART 4. MODERN APPLIED ALGEBRA
14. Rings and Modular Arithmetic
15. Boolean Algebra and Switching Functions
16. Groups, Coding Theory, and Polya's Theory of Enumeration
17. Finite Fields and Combinatorial Designs.
