离散数学

出版时间：2009-4  出版社：电子工业出版社  作者：Richard Johnosonbaugh  页数：766  
Tag标签：无  

前言

This updated edition is intended for a one- or two-term introductory course in discrete mathematics, based on my experience in teaching this course over many years and requests from users of previous editions. Formal mathematics prerequisites are minimal; calculus is not required. There are no computer science prerequisites. The book includes examples, exercises, figures, tables, sections on problem-solving, sections containing problem-solving tips, section reviews, notes, chapter reviews, self-tests, and computer exercises to help the reader master introductory discrete mathematics. In addition, an Instructor's Guide and website are available.In the early 1980s there were few textbooks appropriate for an introductory course in discrete mathematics. However, there was a need for a course that extended students' mathematical maturity and ability to deal with abstraction, which also included useful topics such as combinatorics, algorithms, and graphs. The original edition of thishook （1984） addressed this need and significantly influenced the development of discrete mathematics courses. Subsequently, discrete mathematics courses were endorsed by many groups for several different audiences, including mathematics and computer science majors. A panel of the Mathematical Association of America （MAA） endorsed a year-long course in discrete mathematics. The Educational Activities Board of the Institute of Electrical and Electronics Engineers （IEEE） recommended a freshman discrete mathematics course. The Association for Computing Machinery （ACM） and IEEE accreditation guidelines mandated a discrete mathematics course. This edition, like its predecessors, includes topics such as algorithms, combinatorics, sets, functions, and mathematical induction endorsed by these groups. It also addresses understanding and constructing proofs and, generally, expanding mathematical maturity.

内容概要

本书从算法分析和问题求解的角度，全面系统地介绍了离散数学的基础概念及相关知识，并在其前一版的基础上进行了修改与扩展。书中通过大量实例，深入浅出地讲解了数理逻辑、组合算法、图论、布尔代数、网络模型、形式语言与自动机理论等与计算机科学密切相关的前沿课题，既着重于各部分内容之间的紧密联系，又深入探讨了相关的概念、理论、算法和实际应用。本书内容叙述严谨、推演详尽，各章配有相当数量的习题与书后的提示和答案，为读者迅速掌握相关知识提供了有效的帮助。    本书既可作为计算机科学及计算数学等专业的本科生和研究生教材，也可作为工程技术人员和相关人员的参考书。

作者简介

作者：(美国)Richard Johnosonbaugh

书籍目录

Preface 1 Sets and Logic  　1.1 Sets  　1.2 Propositions  　1.3 Conditional Propositions and Logical Equivalence  　1.4 Arguments and Rules of Inference  　1.5 Quantifiers  　1.6 Nested Quantifiers  　Problem-Solving Corner: Quantifiers  　Notes  　Chapter Review  　Chapter Self-Test  　Computer Exercises  2 Proofs  　2.1 Mathematical Systems, Direct Proofs, and Counterexamples  　2.2 More Methods of Proof 　　Problem-Solving Corner: Proving Some Properties of Real Numbers  　2.3 Resolution Proofst  　2.4 Mathematical Induction 　　Problem-Solving Corner: Mathematical Induction  　2.5 Strong Form of Induction and the Well-Ordering Property  　Notes  　Chapter Review  　Chapter Self-Test  　Computer Exercises  3 Functions, Sequences, and Relations  　3.1 Functions 　　Problem-Solving Corner: Functions  　3.2 Sequences and Strings  　3.3 Relations  　3.4 Equivalence Relations  　　Problem-Solving Corner: Equivalence Relations  　3.5 Matrices of Relations  　3.6 Relational Databasest  　Notes  　Chapter Review  　Chapter Self-Test  　Computer Exercises  4 Algorithms  　4.1 Introduction  　4.2 Examples of Algorithms  　4.3 Analysis of Algorithms  　　Problem-Solving Corner: Design and Analysis of an Algorithm  　4.4 Recursive Algorithms  　Notes  　Chapter Review  　Chapter Self-Test  　Computer Exercises  5 Introduction to Number Theory  　5.1 Divisors  　5.2 Representations of Integers and Integer Algorithms  　5.3 The Euclidean Algorithm  　Problem-Solving Corner: Making Postage  　5.4 The RSA Public-Key Cryptosystem  　Notes  　Chapter Review  　Chapter Self-Test  　Computer Exercises  6 Counting Methods and the Pigeonhole Principle  　6.1 Basic Principles  265　Problem-Solving Corner: Counting  ……7 Recurence Relations8 Graph Theory9 Trees10 Network Models11 Boolean Algebras and Combinatorial Circuits12 Automata, Grammars, and languages13 Computational GeometryA MatricesB Algebra ReviewC PesudocodeReferencesHints and Solutions to Selected ExercisesIndex

章节摘录

插图：

编辑推荐

《离散数学(第7版)(英文版)》为电子工业出版社出版发行。

用户评论 (总计5条)

•   以前看电子版的或在图书馆借着看，经典，现在终于趁狠心买了1000元左右的书。就是选的POS机支付，送货员没有拿机器，最后用的现金。
•   ~~书还是原汁原味来的过瘾！
•   感觉很有压力~~~
•   学校要求的教科书 书的内容写的很清楚 可惜没有全部的详细解答 略遗憾
•   帮别人买的，应该挺好的~快递很给力