Atnaujinkite slapukų nuostatas

Discrete Mathematical Structures 6th edition [Kietas viršelis]

3.56/5 (130 ratings by Goodreads)
  • Formatas: Hardback, 552 pages, aukštis x plotis: 254x203 mm, weight: 1140 g
  • Išleidimo metai: 19-Aug-2008
  • Leidėjas: Pearson
  • ISBN-10: 0132297515
  • ISBN-13: 9780132297516
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 552 pages, aukštis x plotis: 254x203 mm, weight: 1140 g
  • Išleidimo metai: 19-Aug-2008
  • Leidėjas: Pearson
  • ISBN-10: 0132297515
  • ISBN-13: 9780132297516
Kitos knygos pagal šią temą:

Key Message: Discrete Mathematical Structures, Sixth Edition, offers a clear and concise presentation of the fundamental concepts of discrete mathematics. This introductory book contains more genuine computer science applications than any other text in the field, and will be especially helpful for readers interested in computer science. This book is written at an appropriate level for a wide variety of readers, and assumes a college algebra course as the only prerequisite.

Key Topics: Fundamentals; Logic; Counting; Relations and Digraphs; Functions; Order Relations and Structures; Trees; Topics in Graph Theory; Semigroups and Groups; Languages and Finite-State Machines; Groups and Coding

Market: For all readers interested in discrete mathematics.

Preface xi
A Word to Students xv
Fundamentals
1(49)
Sets and Subsets
2(3)
Operations on Sets
5(8)
Sequences
13(7)
Properties of the Integers
20(12)
Matrices
32(9)
Mathematical Structures
41(9)
Logic
50(41)
Propositions and Logical Operations
51(6)
Conditional Statements
57(5)
Methods of Proof
62(6)
Mathematical Induction
68(7)
Mathematical Statements
75(3)
Logic and Problem Solving
78(13)
Counting
91(31)
Permutations
92(4)
Combinations
96(4)
Pigeonhole Principle
100(4)
Elements of Probability
104(8)
Recurrence Relations
112(10)
Relations and Digraphs
122(58)
Product Sets and Partitions
123(4)
Relations and Digraphs
127(8)
Paths in Relations and Digraphs
135(6)
Properties of Relations
141(7)
Equivalence Relations
148(4)
Data Structures for Relations and Digraphs
152(7)
Operations on Relations
159(10)
Transitive Closure and Warshall's Algorithm
169(11)
Functions
180(37)
Functions
181(9)
Functions for Computer Science
190(10)
Growth of Functions
200(5)
Permutation Functions
205(12)
Order Relations and Structures
217(53)
Partially Ordered Sets
218(10)
Extremal Elements of Partially Ordered Sets
228(5)
Lattices
233(10)
Finite Boolean Algebras
243(7)
Functions on Boolean Algebras
250(4)
Circuit Design
254(16)
Trees
270(35)
Trees
271(4)
Labeled Trees
275(5)
Tree Searching
280(8)
Undirected Trees
288(7)
Minimal Spanning Trees
295(10)
Topics in Graph Theory
305(39)
Graphs
306(5)
Euler Paths and Circuits
311(7)
Hamiltonian Paths and Circuits
318(3)
Transport Networks
321(8)
Matching Problems
329(5)
Coloring Graphs
334(10)
Semigroups and Groups
344(42)
Binary Operations Revisited
345(4)
Semigroups
349(7)
Products and Quotients of Semigroups
356(6)
Groups
362(10)
Products and Quotients of Groups
372(5)
Other Mathematical Structures
377(9)
Languages and Finite-State Machines
386(43)
Languages
387(7)
Representations of Special Grammars and Languages
394(9)
Finite-State Machines
403(6)
Monoids, Machines, and Languages
409(5)
Machines and Regular Languages
414(6)
Simplification of Machines
420(9)
Groups and Coding
429(26)
Coding of Binary Information and Error Detection
430(10)
Decoding and Error Correction
440(9)
Public Key Cryptology
449(6)
Appendix A: Algorithms and Pseudocode 455(12)
Appendix B: Additional Experiments in Discrete Mathematics 467(6)
Appendix C: coding Exercises 473(4)
Answers to Odd-Numbered Exercises 477(38)
Answers to
Chapter Self-Tests
515
Glossary 1(1)
Index 1(1)
Photo Credits 1
Bernard Kolman received his BS in mathematics and physics from Brooklyn College in 1954, his ScM from Brown University in 1956, and his PhD from the University of Pennsylvania in 1965, all in mathematics. He has worked as a mathematician for the US Navy and IBM. He has been a member of the mathematics department at Drexel University since 1964, and has served as Acting Head of the department. His research activities have included Lie algebra and perations research. He belongs to a number of professional associations and is a member of Phi Beta Kappa, Pi Mu Epsilon, and Sigma Xi.

 

Robert C. Busby received his BS in physics from Drexel University in 1963, his AM in 1964 and PhD in 1966, both in mathematics from the University of Pennsylvania. He has served as a faculty member of the mathematics department at Drexel since 1969. He has consulted in applied mathematics and industry and government, including three years as a consultant to the Office of Emergency Preparedness, Executive Office of the President, specializing in applications of mathematics to economic problems. He has written a number of books and research papers on operator algebra, group representations, operator continued fractions, and the applications of probability and statistics to mathematical demography.

 

Sharon Cutler Ross received a SB in mathematics from the Massachusetts Institute of Technology in 1965, an MAT in secondary mathematics from Harvard University in 1966, and a PhD in mathematics from Emory University in 1976. She has taught junior high, high school, and college mathematics, and has taught computer science at the collegiate level. She has been a member of the mathematics department at DeKalb College. Her current professional interests are in undergraduate mathematics education and alternative forms of assessment. Her interests and associations include the Mathematical Association of America, the American Mathematical Association of Two-Year Colleges, and UME Trends. She is a member of Sigma Xi and other organizations.