离散数学结构（第6版）（影印版） / 教育部推荐引进版教材
￥65.00定价
作者： [美]Bernard Kolman等
出版时间：2010年11月
出版社：高等教育出版社
- 高等教育出版社
- 9787040310450
- 6版
- 174734
- 0045151128-1
- 异16开
- 2010年11月
- 620
- 522
- 理学
- 数学
- O158
- 计算机科学与技术
- 研究生、本科
内容简介
discrete mathematical structures, sixth edition. offers a clear and concise presentation of the fundamental concepts of discrete mathematics. ideal for a one-semester introductory course, this text contains more genuine computer science applications than any other text in the field. this book is written at an appropriate level for a wide variety of majors and non-majors, and assumes a college algebra course as a prerequisite.
features
the focus on computer science prepares students for future computer science careers.
the emphasis on proof lays the foundation for mathematical thinking.
clear organization of topics prevents students from being overwhelmed. the authors treat relations and digraphs as two aspects of the same fundamental ideawhich is then used as the basis of virtually all the concepts introduced in the book.
vignettes of mathematical history open each chapter, providing students with a practical background of how these ideas were developed.discrete mathematical structures, sixth edition. offers a clear and concise presentation of the fundamental concepts of discrete mathematics. ideal for a one-semester introductory course, this text contains more genuine computer science applications than any other text in the field. this book is written at an appropriate level for a wide variety of majors and non-majors, and assumes a college algebra course as a prerequisite.
features
the focus on computer science prepares students for future computer science careers.
the emphasis on proof lays the foundation for mathematical thinking.
clear organization of topics prevents students from being overwhelmed. the authors treat relations and digraphs as two aspects of the same fundamental ideawhich is then used as the basis of virtually all the concepts introduced in the book.
vignettes of mathematical history open each chapter, providing students with a practical background of how these ideas were developed.
additional number theory coverage provides more information on the properties of integers, including base n representations, and gives more contexts for isomorphism.
cryptology is explored throughout the book, introducing students to this exciting field.
coverage of coding provides students with a full picture of all of its aspects, including efficiency, effectiveness, and security. a set of coding exercises for each chapter is also included in appendix c.
exercises emphasize multiple representations of concepts, and provide practice on reading and writing mathematical proofs.
experiments provide opportunities for in-depth exploration and discovery, as well as for writing and for working in groups. topics include weighted voting systems, petri nets, catalan numbers, and others.
end-of-chapter material includes tips for proofs, a summary of key ideas, and a self-test, which contains a set of conceptual review questions to help students identify and synthesize the main ideas of each chapter.显示全部信息
features
the focus on computer science prepares students for future computer science careers.
the emphasis on proof lays the foundation for mathematical thinking.
clear organization of topics prevents students from being overwhelmed. the authors treat relations and digraphs as two aspects of the same fundamental ideawhich is then used as the basis of virtually all the concepts introduced in the book.
vignettes of mathematical history open each chapter, providing students with a practical background of how these ideas were developed.discrete mathematical structures, sixth edition. offers a clear and concise presentation of the fundamental concepts of discrete mathematics. ideal for a one-semester introductory course, this text contains more genuine computer science applications than any other text in the field. this book is written at an appropriate level for a wide variety of majors and non-majors, and assumes a college algebra course as a prerequisite.
features
the focus on computer science prepares students for future computer science careers.
the emphasis on proof lays the foundation for mathematical thinking.
clear organization of topics prevents students from being overwhelmed. the authors treat relations and digraphs as two aspects of the same fundamental ideawhich is then used as the basis of virtually all the concepts introduced in the book.
vignettes of mathematical history open each chapter, providing students with a practical background of how these ideas were developed.
additional number theory coverage provides more information on the properties of integers, including base n representations, and gives more contexts for isomorphism.
cryptology is explored throughout the book, introducing students to this exciting field.
coverage of coding provides students with a full picture of all of its aspects, including efficiency, effectiveness, and security. a set of coding exercises for each chapter is also included in appendix c.
exercises emphasize multiple representations of concepts, and provide practice on reading and writing mathematical proofs.
experiments provide opportunities for in-depth exploration and discovery, as well as for writing and for working in groups. topics include weighted voting systems, petri nets, catalan numbers, and others.
end-of-chapter material includes tips for proofs, a summary of key ideas, and a self-test, which contains a set of conceptual review questions to help students identify and synthesize the main ideas of each chapter.显示全部信息
目录
preface xvii a word to students xxi 1 fundamentals 1.1 sets and subsets 1.2 operations on sets 1.3 sequences 131.4 properties of integers 1.5 matrices 1.6 mathematical structures 2 logic 2.1 propositions and logical operations 2.2 conditional statements 2.3 methods of proof 2.4 mathematical induction 2.5 mathematical statements 2.6 logic and problem solving 3 counting 3.1 permutations 3.2 combinations 3.3 pigeonhole principle 3.4 elements of probability 3.5 recurrence relations4 relations and digraphs 4.1 product sets and partitions 4.2 relations and digraphs 4.3 paths in relations and digraphs 4.4 properties of relations 4.5 equivalence relations 4.6 data structures for relations and digraphs 4.7 operations on relations 4.8 transitive closure and warshall's algorithm 5 functions 5.1 functions 5.2 functions for computer science 5.3 growth of functions 5.4 permutation functions 6 order relations and structures 6.1 partially ordered sets 6.2 extremal elements of partially ordered sets 6.3 lattices 6.4 finite boolean algebras 6.5 functions on boolean algebras 6.6 circuit design 7 trees 7.1 trees 7.2 labeled trees 7.3 tree searching 7.4 undirected trees 7.5 minimal spanning trees 8 topics in graph theory 8.1 graphs 8.2 euler paths and circuits 8.3 hamiltonian paths and circuits 8.4 transport networks 8.5 matching problems 8.6 coloring graphs 9 semigroups and groups 9.1 binary operations revisited 9.2 semigroups 9.3 products and quotients of semigroups 9.4 groups 9.5 products and quotients of groups 9.6 other mathematical structures 10 languages and finite-state machines 10.1 languages 10.2 representations of special grammars and languages 10.3 finite-state machines 10.4 monoids, machines, and languages 10.5 machines and regular languages 10.6 simplification of machines 11 groups and coding 11.1 coding of binary information and error detection 11.2 decoding and error correction 11.3 public key cryptology appendix a: algorithms and pseudocode 455 appendix b: additional experiments in discrete mathematics appendix c: coding exercises answers to odd-numbered exercises answers to chapter self-tests glossary index photo credits
