网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 教育/科技 > 数学 > 商品详情

离散数学-第七版-英文版

分享到:
离散数学-第七版-英文版

最 低 价:¥59.20

定 价:¥79.00

作 者:(美)约翰逊鲍夫(Johnsonbaug

出 版 社:电子工业出版社

出版时间:2009-4-1

I S B N:9787121085345

价格
59.20元
价格
59.30元
价格
65.60元
价格
67.20元
价格
67.20元
价格
71.10元

商品详情

编辑推荐

内容简介

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

作者简介

目录

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 relations
8 graph theory
9 trees
10 network models
11 boolean algebras and combinatorial circuits
12 automata, grammars, and languages
13 computational geometry
a matrices
b algebra review
c pesudocode
references
hints and solutions to selected exercises
index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...