Atnaujinkite slapukų nuostatas

Discrete Mathematical Structures: United States Edition 4th edition [Kietas viršelis]

  • Formatas: Hardback, 505 pages, aukštis x plotis x storis: 242x209x23 mm, weight: 1071 g
  • Išleidimo metai: 07-Dec-1999
  • Leidėjas: Pearson
  • ISBN-10: 0130831433
  • ISBN-13: 9780130831439
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 505 pages, aukštis x plotis x storis: 242x209x23 mm, weight: 1071 g
  • Išleidimo metai: 07-Dec-1999
  • Leidėjas: Pearson
  • ISBN-10: 0130831433
  • ISBN-13: 9780130831439
Kitos knygos pagal šią temą:
More than any other book in this field, this book ties together discrete topics with a theme. Written at an appropriate level of understanding for those new to the world of abstract mathematics, it limits depth of coverage and areas covered to topics of genuine use in computer science. Chapter topics include fundamentals, logic, counting, relations and digraphs, trees, topics in graph theory, languages and finite-state machines, and groups and coding. For individuals interested in computer science and other related fields ? looking for an introduction to discrete mathematics, or a bridge to more advanced material on the subject.
Preface xi
Fundamentals
1(45)
Sets and Subsets
1(4)
Operations on Sets
5(8)
Sequences
13(8)
Division in the Integers
21(9)
Matrices
30(8)
Mathematical Structures
38(8)
Logic
46(27)
Propositions and Logical Operations
46(6)
Conditional Statements
52(6)
Methods of Proof
58(6)
Mathematical Induction
64(9)
Counting
73(30)
Permutations
73(5)
Combinations
78(5)
Pigeonhole Principle
83(3)
Elements of Probability
86(9)
Recurrence Relations
95(8)
Relations and Digraphs
103(58)
Product Sets and Partitions
103(4)
Relations and Digraphs
107(8)
Paths in Relations and Digraphs
115(6)
Properties of Relations
121(7)
Equivalence Relations
128(5)
Computer Representation of Relations and Digraphs
133(7)
Operations on Relations
140(10)
Transitive Closure and Warshall's Algorithm
150(11)
Functions
161(30)
Functions
161(9)
Functions for Computer Science
170(5)
Growth of Functions
175(5)
Permutation Functions
180(11)
Order Relations and Structures
191(54)
Partially Ordered Sets
191(11)
Extremal Elements of Partially Ordered Sets
202(5)
Lattices
207(10)
Finite Boolean Algebras
217(8)
Functions on Boolean Algebras
225(4)
Circuit Designs
229(16)
Trees
245(35)
Trees
245(5)
Labeled Trees
250(4)
Tree Searching
254(10)
Undirected Trees
264(7)
Minimal Spanning Trees
271(9)
Topics in Graph Theory
280(39)
Graphs
280(6)
Euler Paths and Circuits
286(7)
Hamiltonian Paths and Circuits
293(4)
Transport Networks
297(8)
Matching Problems
305(6)
Coloring Graphs
311(8)
Semigroups and Groups
319(38)
Semigroups
319(5)
Products and Quotients of Semigroups
324(7)
Groups
331(7)
Products and Quotients of Groups
338(19)
Languages and Finite-State Machines
357(44)
Languages
357(9)
Representations of Special Grammars and Languages
366(9)
Finite-State Machines
375(6)
Semigroups, Machines, and Languages
381(5)
Machines and Regular Languages
386(7)
Simplification of Machines
393(8)
Groups and Coding
401(24)
Coding of Binary Information and Error Detection
401(12)
Decoding and Error Correction
413(12)
Appendix A: Alorithms and Pseudocode 425(13)
Appendix B: Experiments in Discrete Mathematics 438(17)
Answers to Odd-Numbered Exercises 455(34)
Answers to
Chapter Self-Tests
489(13)
Index 502