| | | 離散數學結構(第6版影印版國外優秀信息科學與技術繫列教學用書) | 該商品所屬分類:考試 -> 成人高考 | 【市場價】 | 588-852元 | 【優惠價】 | 368-533元 | 【介質】 | book | 【ISBN】 | 9787040310450 | 【折扣說明】 | 一次購物滿999元台幣免運費+贈品 一次購物滿2000元台幣95折+免運費+贈品 一次購物滿3000元台幣92折+免運費+贈品 一次購物滿4000元台幣88折+免運費+贈品
| 【本期贈品】 | ①優質無紡布環保袋,做工棒!②品牌簽字筆 ③品牌手帕紙巾
| |
版本 | 正版全新電子版PDF檔 | 您已选择: | 正版全新 | 溫馨提示:如果有多種選項,請先選擇再點擊加入購物車。*. 電子圖書價格是0.69折,例如了得網價格是100元,電子書pdf的價格則是69元。 *. 購買電子書不支持貨到付款,購買時選擇atm或者超商、PayPal付款。付款後1-24小時內通過郵件傳輸給您。 *. 如果收到的電子書不滿意,可以聯絡我們退款。謝謝。 | | | | 內容介紹 | |
-
出版社:高等教育
-
ISBN:9787040310450
-
作者:(美)科曼//巴斯比//羅斯
-
頁數:522
-
出版日期:2010-11-01
-
印刷日期:2010-11-01
-
包裝:平裝
-
開本:16開
-
版次:1
-
印次:1
-
字數:620千字
-
由科曼等編著的《離散數學結構》可作為離散數學基本概念的入門書,並作為向***數學概念發展的基礎。如果**於此,那麼書中涉及計算機科學的一些特定應用可以略去或者單獨作為重要的例子選用。本書可作為計算機科學或者電子與計算機工程課程的教材,它也為計算機相關的許多基本概念打下基礎,並且為這些概念提供延伸、發展和共同的主題。通過參考每章的**知識,教師很容易設計出與各章內容相一致的、適當的教學大綱。
-
Preface A Word to Students 1 Fundamentals l.1 Sets and Subsets 1.2 Operations on Sets 1.3 Sequences 1.4 Properties of Integers 1.5 Matrices 1.6 Mathematical Structures 2 Logic 2.1 Propositions and Logical Operations 2.2 Conditional Statements 2.3 Methods of Proof 2.4 Mathematical Induction 2.5 Mathematical Statements 2.6 Logic and Problem Solving 3 Counting 3.1 Permutations 3.2 Combinations 3.3 Pigeonhole Principle 3.4 Elements of Probability 3.5 Recurrence Relations 4 Relations and Digraphs 4.1 Product Sets and Partitions 4.2 Relations and Digraphs 4.3 Paths in Relations and Digraphs 4.4 Properties of Relations 4.5 Equivalence Relations 4.6 Data Structures for Relations and Digraphs 4.7 Operations on Relations 4.8 Transitive Closure and Warshall's Algorithm 5 Functions 5.1 Functions 5.2 Functions for Computer Science 5.3 Growth of Functions 5.4 Permutation Functions 6 Order Relations and Structures 6.1 Partially Ordered Sets 6.2 Ex.tremal Elements of Partially Ordered Sets 6.3 Lattices 6.4 Finite Boolean, Algebras 6.5 Functions on Boolean Algebras 6.6 Circuit Design 7 Trees 7.1 Trees 7.2 Labeled Trees 7.3 Tree Searching 7.4 Undirected Trees 7.5 Minimal Spanning Trees 8 Topics in Graph Theory 8.1 Graphs 8.2 Euler Paths and Circuits 8.3 Hamiltonian Paths and Circuits 8.4 Transport Networks 8.5 Matching Problems 8.6 Coloring Graphs 9 Semigroups and Groups 9.1 Binary Operations Revisited 9.2 Semigroups 9.3 Products and Quotients of Semigroups 9.4 Groups 9.5 Products and Quotients of Groups 9.6 Other Mathematical Structures 10 Languages and Finite-State Machines 10.1 Languages 10.2 Representations of Special Grammars and Languages 10.3 Finite-State Machines 10.4 Monoids, Machines, and Languages 10.5 Machines and Regular Languages 10.6 Simplification of Machines 11 Groups and Coding 11.1 Coding of Binary Information and Error Detection 11.2 Decoding and Error Correction 11.3 Public Key Cryptology Appendix A: Algorithms and Pseudocode Appendix B: Additional Experiments in Discrete Mathematics Appendix C: Coding Exercises Answers to Odd-Numbered Exercises Answers to Chapter Self-Tests Glossary G-1 Index 1-1 Photo Credits P-1
| | | | | |