2026-3-4 18:45:15 周三
  忘记密码
帐号
密码
  
首  页 | 文化新闻 | 出版社 | 发行单位 | 出版观澜 | 馆配 | 图书 | 音像 | 报刊 | 电子出版物 | 文化艺术品 | 诗意名城 | 一字千金
动  漫 | 休闲游戏 | 手机小说报 | 视 频 | 文交会 | 文化焦点 | 名家名作 | 我新我秀 | BBS | EMBA | 29中 | 总平台
  购买本书的顾客还买过  
天下阅读·感恩
天下阅读·感恩
中国式饭局读心术
中国式饭局读心术
蔡康永说话之道
蔡康永说话之道
十二味生活设计
十二味生活设计
乌合之众
乌合之众
天才在左疯子在右
天才在左疯子在右
  销售排行  
 战国策1
 女真族的一支后裔——仝姓
 女性的资本
 WINDOWS CE6开发经典
 解剖生理学基础学习指导与习..
 每天10分钟轻松掌握C++..
 影响一生智慧的寓言历史故事
 Vista安全管理
江苏发行网 >> 图书 >> 文学
离散数学(第七版)英文版
离散数学(第七版)英文版
商品编号:JSFXW20090909164149 版号:7121085348/9787121085345
开    本:16开 装帧:平装
版    次:2009年04月1版
发行单位:江苏发行网
出版单位:电子工业出版社
著 作 者::(美国)Richard Johnosonbaugh
商品数量:100本 被浏览303次  热卖中
商品折扣:8.2 折  赠送积分:0分  共节省14.20元
商品价格: ¥79.00元
¥64.80元
市场价 会员价

内容简介


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


 


推荐理由


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


 


目录



Preface XI
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 Databases
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
Problem-Solving Corner: Counting
6.2 Permutations and Combinations
Problem-Solving Comer:. Combinations
6.3 Generalized Permutations and Combinations
6.4 Algorithms for Generating Permutations and Combinations
6.5 Introduction to Discrete Probabilityt
6.6 Discrete Probability Theoryt
6.7 Binomial Coefficients and Combinatorial Identities
6.8 The Pigeonhole Principle
Notes
Chapter Review
Chapter Self-Test
Computer Exercises

7 Recurrence Relations
7.1 Introduction
7.2 Solving Recurrence Relations
Problem-Solving Corner: Recurrence Relations
7.3 Applications to the Analysis of Algorithms ..
Notes
Chapter Review
Chapter Self-Test
Computer Exercises

8 Graph Theory
8.1 Introduction
8.2 Paths and Cycles
Problem-Solving Corner: Graphs
8.3 Hamiltonian Cycles and the Traveling Salesperson Problem
8.4 A Shortest-Path Algorithm
8.5 Representations of Graphs
8.6 Isomorphisms of Graphs
8.7 Planar Graphs
8.8 Instant Insanityt
Notes
Chapter Review
Chapter Self-Test
Computer Exercises

9 Trees
9.1 Introduction
9.2 Terminology and Characterizations of Trees
Problem-Solving Corner: Trees
9.3 Spanning Trees
9.4 Minimal Spanning Trees
9.5 Binary Trees
9.6 Tree Traversals
9.7 Decision Trees and the Minimum Time for Sorting
9.8 Isomorphisms of Trees
9.9 Game Treest
Notes
Chapter Review
Chapter Self-Test
Computer Exercises

10 Network Models
10.1 Introduction
10.2 A Maximal Flow Algorithm
10.3 The Max Flow, Min Cut Theorem
10.4 Matching
Problem-Solving Corner: Matching
Notes
Chapter Review
Chapter Self-Test
Computer Exercises

11 Boolean Algebras and Combinatorial Circuits
11.1 Combinatorial Circuits
11.2 Properties of Combinatorial Circuits
11.3 Boolean Algebras
Problem-Solving Corner: Boolean Algebras
11.4 Boolean Functions and Synthesis of Circuits
11.5 Applications
Notes
Chapter Review
Chapter Self-Test
Computer Exercises

12 Automata,Grammars,and Languages
12.1 Sequential Circuits and Finite-State Machines
12.2 Finite-State Automata
12.3 Languages and Grammars
12.4 Nondeterministic Finite-State Automata
12.5 Relationships Between Languages and Automata
Notes
Chapter Review
Chapter Self-Test
Computer Exercises

13 Computational Geometry
13.1 The Closest-Pair Problem
13.2 An Algorithm to Compute the Convex Hull
Notes
Chapter Review
Chapter Self-Test
Computer Exercises
Appendix
A Matrices
B Algebra Review
C Pseudocode
References
Hints and Solutions to Selected Exercises
Index
……

星级指数: ☆☆ ☆☆☆ ☆☆☆☆ ☆☆☆☆☆
标    题:
内    容:
 
配送范围 如何交款 我的订单 售后服务 需要帮助
运费收取标准
■ 配送时间和配送范围
付款方式
■ 汇款单招领
如何查询订单情况
■ 怎样下订单
■ 退换货原则
■ 退换货处理
忘记了密码
 
关于我们 | 友情链接 | 网站地图 | 汇款方式 | 帮助中心 | 合同下载
在线客服:江苏发行网温馨客服二 江苏发行网温馨客服四
中华人民共和国增值电信业务经营许可证号:苏B2-20100342 备案号:苏ICP备10223332号-2
网站服务电话:025-51861377 发行协会电话:025-83361842 服务邮箱:admin@jsfxw.com
版权所有 上书房 法律顾问团:鲍平 律师、邱宝军 律师