注册 登录 进入教材巡展
#
  • #

出版时间:2019-12

出版社:机械工业出版社

以下为《离散数学及其应用(英文精编版·原书第8版)》的配套数字资源,这些资源在您购买图书后将免费附送给您:
试读
  • 机械工业出版社
  • 9787111643029
  • 1-2
  • 283810
  • 46256155-6
  • 平装
  • 16开
  • 2019-12
  • 200
  • 539
  • 理学
  • 数学
  • O212
  • 计算机科学与技术
  • 本科
作者简介
肯尼思·H. 罗森(Kenneth H. Rosen) 于1972年获密歇根大学安娜堡分校数学学士学位,1976年获麻省理工学院数学博士学位。Rosen曾就职于科罗拉多大学、俄亥俄州立大学、缅因大学和蒙茅斯大学,教授离散数学、算法设计和计算机安全方面的课程;他还曾加盟贝尔实验室,并且是AT&T贝尔实验室的杰出技术人员。他的著作《初等数论及其应用》和《离散数学及其应用》均被翻译成多种语言,在全球数百所大学中广为采用。
查看全部
内容简介
本书是经典的离散数学教材,被全球数百所大学广为采用。英文精编版为满足本科教学需求而缩减了篇幅,保留的主要内容包括:逻辑和证明,集合、函数、序列、求和与矩阵,计数,关系,图,树,布尔代数。全书取材广泛,除包括定义、定理的严格陈述外,还配备大量的例题、图表、应用实例和练习。第8版做了与时俱进的更新,成为更加实用的教学工具。本书可作为高等院校数学、计算机科学和计算机工程等专业的教材,也可作为科技领域从业人员的参考书。
目录
The Adapter's WordsPrefaceOnline ResourcesTo the Student About the AuthorList of Symbols1 The Foundations: Logic and Proofs 11.1 Propositional Logic 11.2 Applications of Propositional Logic 151.3 Propositional Equivalences 221.4 Predicates and Quantifiers 341.5 Nested Quantifiers 511.6 Rules of Inference 621.7 Introduction to Proofs 721.8 Proof Methods and Strategy 84End-of-ChapterMaterial (Online)2 Basic Structures: Sets, Functions, Sequences, Sums, and Matrices 1012.1 Sets 1012.2 Set Operations 1112.3 Functions 1242.4 Sequences and Summations 1402.5 Cardinality of Sets 1532.6 Matrices 161End-of-ChapterMaterial (Online)3 Counting 1693.1 The Basics of Counting 1693.2 The Pigeonhole Principle 1823.3 Permutations and Combinations 1893.4 Binomial Coefficients and Identities 1973.5 Generalized Permutations and Combinations 2043.6 Generating Permutations and Combinations 215End-of-ChapterMaterial (Online)4 Advanced Counting Techniques 2214.1 Applications of Recurrence Relations 2214.2 Solving Linear Recurrence Relations 2324.3 Divide-and-Conquer Algorithms and Recurrence Relations 2444.4 Generating Functions 2534.5 Inclusion朎xclusion 2684.6 Applications of Inclusion朎xclusion 273End-of-ChapterMaterial (Online)5 Relations 2815.1 Relations and Their Properties 2815.2 n-ary Relations and Their Applications 2925.3 Representing Relations 3025.4 Closures of Relations 3085.5 Equivalence Relations 3175.6 Partial Orderings 327End-of-ChapterMaterial (Online)6 Graphs 3436.1 Graphs and Graph Models 3436.2 Graph Terminology and Special Types of Graphs 3546.3 Representing Graphs and Graph Isomorphism 3716.4 Connectivity 3806.5 Euler and Hamilton Paths 3936.6 Shortest-Path Problems 4056.7 Planar Graphs 4156.8 Graph Coloring 423End-of-ChapterMaterial (Online)7 Trees 4317.1 Introduction to Trees 4317.2 Applications of Trees 4427.3 Tree Traversal 4567.4 Spanning Trees 4687.5 Minimum Spanning Trees 481End-of-ChapterMaterial (Online)8 Boolean Algebra 4878.1 Boolean Functions 4878.2 Representing Boolean Functions 4948.3 Logic Gates 4978.4 Minimization of Circuits 503End-of-ChapterMaterial (Online)Suggested Readings (Online)Answers to Odd-Numbered Exercises (Online)