国外计算机科学教材系列离散数学(第8版)(英文版)/(美)RICHARD JOHNSONBAUGH(理查德.约翰逊鲍夫)
本书特色
[
本书从算法分析和问题求解的角度，全面系统地介绍了离散数学的基础概念及相关知识，并在其前一版的基础上进行了修改与扩展。书中通过大量实例，深入浅出地讲解了集合与逻辑，证明，函数、序列与关系，算法，数论，计数方法与鸽巢原理，递推关系，图论，树，网络模型，Boole代数与组合电路，自动机、文法和语言等与计算机科学密切相关的前沿课题，既着重于各部分内容之间的紧密联系，又深入探讨了相关的概念、理论、算法和实际应用。本书内容叙述严谨、推演详尽，各章配有相当数量的习题与书后的提示和答案，为读者迅速掌握相关知识提供了有效的帮助。
]
内容简介
[
本书从算法分析和问题求解的角度，全面系统地介绍了离散数学的基础概念及相关知识，并在其前一版的基础上进行了修改与扩展。书中通过大量实例，深入浅出地讲解了集合与逻辑，证明，函数、序列与关系，算法，数论，计数方法与鸽巢原理，递推关系，图论，树，网络模型，Boole代数与组合电路，自动机、文法和语言等与计算机科学密切相关的前沿课题，既着重于各部分内容之间的紧密联系，又深入探讨了相关的概念、理论、算法和实际应用。本书内容叙述严谨、推演详尽，各章配有相当数量的习题与书后的提示和答案，为读者迅速掌握相关知识提供了有效的帮助。
]
作者简介
[
Richard Johnsonbaugh是美国芝加哥DePaul大学的计算机科学、通信与信息系统的Emeritus教授，并在DePaul大学的从事了20年教学工作，之前曾任莫尔豪斯学院和芝加哥州立大学的数学系教师和系主任一职。Johnsonbaugh教授在耶鲁大学获得数学学士学位、硕士学位，并获得俄勒冈大学的数学博士学位以及伊利诺伊大学的计算机硕士学位。Johnsonbaugh教授近期的研究领域包括模式识别、程序设计语言、算法和离散数学，他也是这些领域众多书籍和文章的作者或合著者。Johnsonbaugh教授的几本专著已被译成各种语言出版，他也是美国数学协会的成员。
Richard Johnsonbaugh是美国芝加哥DePaul大学的计算机科学、通信与信息系统的Emeritus教授，并在DePaul大学的从事了20年教学工作，之前曾任莫尔豪斯学院和芝加哥州立大学的数学系教师和系主任一职。Johnsonbaugh教授在耶鲁大学获得数学学士学位、硕士学位，并获得俄勒冈大学的数学博士学位以及伊利诺伊大学的计算机硕士学位。Johnsonbaugh教授近期的研究领域包括模式识别、程序设计语言、算法和离散数学，他也是这些领域众多书籍和文章的作者或合著者。Johnsonbaugh教授的几本专著已被译成各种语言出版，他也是美国数学协会的成员。
]
目录
Contents1 Sets and Logic 11.1 Sets 21.2 Propositions 141.3 Conditional Propositions and Logical Equivalence 201.4 Arguments and Rules of Inference 311.5 Quantifiers 361.6 Nested Quantifiers 49Problem-Solving Corner: Quantifiers 57Chapter 1 Notes 58Chapter 1 Review 58Chapter 1 Self-Test 60Chapter 1 Computer Exercises 602 Proofs 622.1 Mathematical Systems, Direct Proofs,and Counterexamples 632.2 More Methods of Proof 72Problem-Solving Corner: Proving Some Propertiesof Real Numbers 832.3 Resolution Proofs? 852.4 Mathematical Induction 88Problem-Solving Corner: Mathematical Induction 1002.5 Strong Form of Induction and the Well-Ordering Property 102Chapter 2 Notes 109Chapter 2 Review 109Chapter 2 Self-Test 109Chapter 2 Computer Exercises 1103 Functions, Sequences, and Relations 1113.1 Functions 111Problem-Solving Corner: Functions 1283.2 Sequences and Strings 1293.3 Relations 1413.4 Equivalence Relations 151Problem-Solving Corner: Equivalence Relations 1583.5 Matrices of Relations 1603.6 Relational Databases? 165Chapter 3 Notes 170Chapter 3 Review 170Chapter 3 Self-Test 171Chapter 3 Computer Exercises 1724 Algorithms 1734.1 Introduction 1734.2 Examples of Algorithms 1774.3 Analysis of Algorithms 184Problem-Solving Corner: Design and Analysisof an Algorithm 2024.4 Recursive Algorithms 204Chapter 4 Notes 211Chapter 4 Review 211Chapter 4 Self-Test 212Chapter 4 Computer Exercises 2125 Introduction to Number Theory 2145.1 Divisors 2145.2 Representations of Integers and Integer Algorithms 2245.3 The Euclidean Algorithm 238Problem-Solving Corner: Making Postage 2495.4 The RSA Public-Key Cryptosystem 250Chapter 5 Notes 252Chapter 5 Review 253Chapter 5 Self-Test 253Chapter 5 Computer Exercises 2546 Counting Methods and the PigeonholePrinciple 2556.1 Basic Principles 255Problem-Solving Corner: Counting 2676.2 Permutations and Combinations 269Problem-Solving Corner: Combinations 2816.3 Generalized Permutations and Combinations 2836.4 Algorithms for Generating Permutations andCombinations 2896.5 Introduction to Discrete Probability? 2976.6 Discrete Probability Theory? 3016.7 Binomial Coefficients and Combinatorial Identities 3136.8 The Pigeonhole Principle 319Chapter 6 Notes 324Chapter 6 Review 324Chapter 6 Self-Test 325Chapter 6 Computer Exercises 3267 Recurrence Relations 3277.1 Introduction 3277.2 Solving Recurrence Relations 338Problem-Solving Corner: Recurrence Relations 3507.3 Applications to the Analysis of Algorithms 3537.4 The Closest-Pair Problem? 365Chapter 7 Notes 370Chapter 7 Review 371Chapter 7 Self-Test 371Chapter 7 Computer Exercises 3728 Graph Theory 3738.1 Introduction 3738.2 Paths and Cycles 384Problem-Solving Corner: Graphs 3958.3 Hamiltonian Cycles and the Traveling SalespersonProblem 3968.4 A Shortest-Path Algorithm 4058.5 Representations of Graphs 4108.6 Isomorphisms of Graphs 4158.7 Planar Graphs 4228.8 Instant Insanity? 429Chapter 8 Notes 433Chapter 8 Review 434Chapter 8 Self-Test 435Chapter 8 Computer Exercises 4369 Trees 4389.1 Introduction 4389.2 Terminology and Characterizations of Trees 445Problem-Solving Corner: Trees 4509.3 Spanning Trees 4529.4 Minimal Spanning Trees 4599.5 Binary Trees 4659.6 Tree Traversals 4719.7 Decision Trees and the Minimum Time for Sorting 4779.8 Isomorphisms of Trees 4839.9 Game Trees? 493Chapter 9 Notes 502Chapter 9 Review 502Chapter 9 Self-Test 503Chapter 9 Computer Exercises 50510 Network Models 50610.1 Introduction 50610.2 A Maximal Flow Algorithm 51110.3 The Max Flow, Min Cut Theorem 51910.4 Matching 523Problem-Solving Corner: Matching 528Chapter 10 Notes 529Chapter 10 Review 530Chapter 10 Self-Test 530Chapter 10 Computer Exercises 53111 Boolean Algebras and CombinatorialCircuits 53211.1 Combinatorial Circuits 53211.2 Properties of Combinatorial Circuits 53911.3 Boolean Algebras 544Problem-Solving Corner: Boolean Algebras 54911.4 Boolean Functions and Synthesis of Circuits 55111.5 Applications 556Chapter 11 Notes 564Chapter 11 Review 565Chapter 11 Self-Test 565Chapter 11 Computer Exercises 56712 Automata, Grammars, and Languages 56812.1 Sequential Circuits and Finite-State Machines 56812.2 Finite-State Automata 57412.3 Languages and Grammars 57912.4 Nondeterministic Finite-State Automata 58912.5 Relationships Between Languages and Automata 595Chapter 12 Notes 601Chapter 12 Review 602Chapter 12 Self-Test 602Chapter 12 Computer Exercises 603Appendix 605A Matrices 605B Algebra Review 609C Pseudocode 620References 627Hints and Solutions to Selected Exercises 633Index 735
封面
书名:国外计算机科学教材系列离散数学(第8版)(英文版)/(美)RICHARD JOHNSONBAUGH(理查德.约翰逊鲍夫)
作者:（美）Richard Johnsonba
页数:768
定价:¥128.0
出版社:电子工业出版社
出版日期:2017-05-01
ISBN:9787121344671
PDF电子书大小:152MB 高清扫描完整版