图书介绍
离散数学及其应用 第5版 英文版PDF|Epub|txt|kindle电子书版本网盘下载
- （美）罗森（Rosen，K.H.）著 著
- 出版社： 机械工业出版社
- ISBN：7111115031
- 出版时间：2003
- 标注页数：932页
- 文件大小：96MB
- 文件页数：40036036页
- 主题词：离散数学－英文
PDF下载
下载说明
离散数学及其应用 第5版 英文版PDF格式电子书版下载
下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！
（文件页数 要大于 标注页数，上中下等多册电子书除外）
注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具
图书目录
1 The Foundations:Logic and Proof,Sets,and Functions1
1.1 Logic1
1.2 Propositional Equivalences20
1.3 Predicates and Quantiers28
1.4 Nested Quantiers44
1.5 Methods of Proof56
1.6 Sets77
1.7 Set Operations86
1.8 Functions97
End-of-Chapter Material111
2 The Fundamentals: Algorithms, the Integers,and Matrices119
2.1 Algorithms120
2.2 The Growth of Functions131
2.3 Complexity of Algorithms144
2.4 The Integers and Division153
2.5 Integers and Algorithms169
2.6 Applications of Number Theo181
2.7 Matrices196
End-of-Chapter Material206
3 Mathematical Reasoning, Induction,and Recursion213
3.1 Proof Strategy214
3.2 Sequences and Summations225
3.3 Mathematical Induction238
3.4 Recursive Denitions d Structural Induction256
3.5 Recursive Algorithms274
3.6 Program Correctness284
End-of-Chapter Material290
4 Counting301
4.1 The Basics of Counting301
4.2 The Pigeonhole Pnciple313
4.3 Permutations and Combinations320
4.4 Binomial Coefcients327
4.5 Generalized Permutations and Combinations335
4.6 Generating Permutations and Combinations344
End-of-Chapter Material349
5 Discrete Probability355
5.1 An Introduction to Discrete Probability355
5.2 Probability Theory362
5.3 Expected Value and Variance379
End-of-Chapter Material394
6 Advanced Counting Techniques401
6.1 Recurrence Relations401
6.2 Solving Recurrence Relations413
6.3 Divide-and-Conquer Algorithms and Recurrence Relations425
6.4 Generating Functions435
6.5 Inclusion-Exclusion451
6.6 Applications of Inclusion-Exclusion457
End-of-Chapter Material465
7 Relations471
7.1 Relations and Their Properties471
7.2 n-a Relations and Their Applications482
7.3 Representing Relations489
7.4 Closures of Relations496
7.5 Equivalence Relations507
7.6 Partial Orderings516
End-of-Chapter Material530
8 Graphs537
8.1 Introduction to Graphs537
8.2 Graph Terminology545
8.3 Representing Graphs and Graph Isomorphism557
8.4 Connectivity567
8.5 Euler and Hamilton Paths577
8.6 Shoest-Path Problems593
8.7 Planar Graphs603
8.8 Graph Coloring613
End-of-Chapter Material622
9 Trees631
9.1 Introduction to Trees631
9.2 Applications of Trees644
9.3 Tree Traversal660
9.4 Spanning Trees674
9.5 Minimum Spanning Trees688
End-of-Chapter Material694
10 Boolean Algebra701
10.1 Boolean Functions701
10.2 Representing Boolean Functions709
10.3 Logic Gates712
10.4 Minimization of Circuits719
End-of-Chapter Material734
11 Modeling Computation739
11.1 Languages and Grammars739
11.2 Finite-State Machines with Output751
11.3 Finite-State Machines with No Output758
11.4 Language Recognition765
11.5 Turing Machines775
End-of-Chapter Material783