图书介绍

离散数学结构pdf电子书版本下载

离散数学结构
  • (美)Bernard Kolman等著 著
  • 出版社: 北京:高等教育出版社
  • ISBN:7040100967
  • 出版时间:2001
  • 标注页数:505页
  • 文件大小:40MB
  • 文件页数:524页
  • 主题词:

PDF下载


点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快] 温馨提示:(请使用BT下载软件FDM进行下载)软件下载地址页 直链下载[便捷但速度慢]   [在线试读本书]   [在线获取解压码]

下载说明

离散数学结构PDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台)。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如 BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用!后期资源热门了。安装了迅雷也可以迅雷进行下载!

(文件页数 要大于 标注页数,上中下等多册电子书除外)

注意:本站所有压缩包均有解压码: 点击下载压缩包解压工具

图书目录

1 Fundamentals 1

1.1 Sets and Subsets 1

1.2 Operations on Sets 5

1.3 Sequences 13

1.4 Division in the Integers 21

1.5 Matrices 30

1.6 Mathematical Structures 38

2.1 Propositions and Logical Operations 46

2 Logic 46

2.2 Conditional Statements 52

2.3 Methods of Proof 58

2.4 Mathematical Induction 64

3 Counting 73

3.1 Permutations 73

3.2 Combinations 78

3.3 Pigeonhole Principle 83

3.4 Elements of Probability 86

3.5 Recurrence Relations 95

4 Relations and Digraphs 103

4.1 Product Sets and Partitions 103

4.2 Relations and Digraphs 107

4.3 Paths in Relations and Digraphs 115

4.4 Properties of Relations 121

4.5 Equivalence Relations 128

4.6 Computer Representation of Relations and Digraphs 133

4.7 Operations on Relations 140

4.8 Transitive Closure and Warshall s Algorithm 150

5 Functions 161

5.1 Functions 161

5.2 Functions for Computer Science 170

5.3 Growth of Functions 175

5.4 Permutation Functions 180

6 Order Relations and Structures 191

6.1 Partially Ordered Sets 191

6.2 Extremal Elements of Partially Orderd Sets 202

6.3 Lattices 207

6.4 Finite Boolean Algebras 217

6.5 Functions on Boolean Algebras 225

6.6 Circuit Designs 229

7 Trees 245

7.1 Trees 245

7.2 Labeled Trees 250

7.3 Tree Searching 254

7.4 Undirected Trees 264

7.5 Minimal Spanning Trees 271

8.1 Graphs 280

8 Topics in Graph Theory 280

8.2 Euler Paths and Circuits 286

8.3 Hamiltonian Paths and Circuits 293

8.4 Transport Networks 297

8.5 Matching Problems 305

8.6 Coloring Graphs 311

9 Semigroups and Groups 319

9.1 Binary Operations Revisited 319

9.2 Semigroups 324

9.3 Products and Quotients of Semigroups 331

9.4 Grouos 338

9.5 Products and Quotients of Groups 349

10 Languages and Finite-State Machines 357

10.1 Languages 357

10.2 Representations of Special Grammars and Languages 366

10.3 Finite-State Machines 375

10.4 Semigroups, Machines, and Languages 381

10.5 Machines and Regular Languages 386

10.6 Simplification of Machines 393

11 Groups and Coding 401

11.1 Coding of Binary Information and Error Detection 401

11.2 Decoding and Error Correction 413

Appendix A: Algorithms and Pseudocode 425

Appendix B: Experiments in Discrete Mathematics 438

Answers to Odd-Numbered Exercises 455

Answers to Chapter Self-Tests 489

Index 502

精品推荐