離散數(shù)學(xué)及其應(yīng)用（英文版）

定　價(jià)：￥59.00

作　者：	（美）Kenneth H.Rosen著
出版社：	機(jī)械工業(yè)出版社
叢編項(xiàng)：	計(jì)算機(jī)科學(xué)叢書(shū)
標(biāo)　簽：	離散數(shù)學(xué)

購(gòu)買(mǎi)這本書(shū)可以去

當(dāng)當(dāng)網(wǎng) (￥47.20)

ISBN：	9787111072546	出版時(shí)間：	1999-01-01	包裝：	平裝
開(kāi)本：	26cm	頁(yè)數(shù)：	678頁(yè)	字?jǐn)?shù)：

內(nèi)容簡(jiǎn)介

　　本書(shū)是作者在多年教授離散數(shù)學(xué)所獲得的經(jīng)驗(yàn)基礎(chǔ)上寫(xiě)出的，其目的是為學(xué)生提供準(zhǔn)確而可讀的教材，使離散數(shù)學(xué)的概念和技術(shù)得以清晰地介紹和演示。向愛(ài)懷疑的學(xué)生們展示離散數(shù)學(xué)的實(shí)用性。為計(jì)算機(jī)科學(xué)專(zhuān)業(yè)的學(xué)生提供一切必需的數(shù)學(xué)基礎(chǔ)。使數(shù)學(xué)專(zhuān)業(yè)的學(xué)生理解數(shù)學(xué)概念的重要性以及這些概念為什么對(duì)應(yīng)用而言是重要的。為教師（指導(dǎo)者）設(shè)計(jì)一個(gè)靈活而全面的教學(xué)工具。本教材的內(nèi)容包括了邏輯、代數(shù)、圖論、組合數(shù)學(xué)和計(jì)算理論的基礎(chǔ)知識(shí)，講解生動(dòng)而直觀，可作為1至2個(gè)學(xué)期離散數(shù)學(xué)入門(mén)課的教材，適用于包括數(shù)學(xué)專(zhuān)業(yè)、計(jì)算機(jī)科學(xué)專(zhuān)業(yè)、工程專(zhuān)業(yè)在內(nèi)的許多專(zhuān)業(yè)的學(xué)生。

作者簡(jiǎn)介

暫缺《離散數(shù)學(xué)及其應(yīng)用（英文版）》作者簡(jiǎn)介

圖書(shū)目錄

     CONTENTS
   Preface ix
   The Companion Web Site xix
   TotheStudent xxi
   1
   The Foundations: Logic, Sets, and Functions
    1.1Logic
    1.2Propositional Equivalences
    1.3Predicates and Quantifiers
    1.4Sets
    1.5Set Operations
    1.6Functions
    1.7Sequences and Summations
    1.8The Growth of Functions
    Key Tenns and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   2
   The Fundamentals: Algorithms, the Integers, and Matrices
    2.1Algorithms
    2.2ComplexityofAlgorithms
    2.3The Integers and Division
    2.4Integers and Algorithms
    2.5Applications of Number Theory
    2.6Matrices
    Key Terms and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Exploratiuns
    Writing Projects
   3
   Mathematical Reasoning
    3.1MethodsofProof
    3.2Mathematical Induction
    3.3Recursive Definitions
    3.4Recursive Algorithms
    3.5Program Correctness
    Key Tenns and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   4
   Counting
    4.1The Basics of Counting
    4.2The Pigeonhole Principle
    4.3Pennutations and Combinations
    4.4Discrete Probability
    4.5Probability Theory
    4.6Generalized Pennutations and Combinations
    4.7Generating Pennutations and Combinations
    Key Terms and Concepts
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   5
   Advanced Counting Techniques
    5.1Recurrence Relations
    5.2Solving Recurrcnce Relarions
    5.3Divide-and-Conquer Relations
    5.4Generating Functions
    5.5Inclusion-Exclusion
    5.6Applications of Inclusion-Exclusion
    Key Terms and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   6
   Relations
    6.lRelations and Their Properties
    6.2n-ary Relations and Their Applications
    6.3Representing Relations
    6.4ClosurcsofRelations
    6.5Equivalence Relations
    6.6Partial Orderings
    Key Terms and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Prqjects
   7
   Graphs
    7.1Introduction to Graphs
    7.2Graph Tenninology
    7.3Representing Graphs and Graph Isomorphism
    7.4Connectivity
    7.5Euler and Hamilton Paths
    7.6Shortest Path Problems
    7.7Planar Graphs
    7.8Graph Coloring
    Key Terms and Results :
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   8
   Trees
    8.l Introduction to Trees
    8.2 Applications ofTrees
    8.3 Tree Traversal
    8.4 Trees and Sorting
    8.5 Spanning Trees
    8.6 Minimum Spanning Trees
    Key Terms and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   9
   Boolean Algebra
    9.1Boolean Functions
    9.2Representing Boolean Functions
    9.3Logic Gates
    9.4MinimizationofCircuits
    Key Terms and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   10
   Modeling Computation
    10.1Languages and Grammars
    10.2Finite-State Machines with Output
    10.3Finite-State Machines with No Output
    10.4Language Recognition
    10.5Turing Machines
    Key Tenns and Results
    Review Questions
    Supplementary Exercises
    Computer Projects
    Computations and Explorations
    Writing Projects
   Appendixes A-l
    A.1Exponential and Logarithmic Functions
    A.2Pseudocode
   Suggested Readings B-l
   Index of Biographies 1-1
   Index 1-3
   LISTOFSYMBOLS L-l