Discrete Mathematical Structures
United States Edition
4th Edition
Published on 7. December 1999
Book
Hardback
505 pages
978-0-13-083143-9 (ISBN)
Description
For one/two-term, freshman/sophomore-level courses in Discrete Mathematics.
More than any other book in the field, this text ties together discrete topics with a theme. Written at an appropriate level of rigor-with a strong pedagogical focus-it limits depth of coverage and areas covered to topics of genuine use in computer science. An emphasis on both basic theory and applications provides students with a firm foundation for more advanced courses.
More than any other book in the field, this text ties together discrete topics with a theme. Written at an appropriate level of rigor-with a strong pedagogical focus-it limits depth of coverage and areas covered to topics of genuine use in computer science. An emphasis on both basic theory and applications provides students with a firm foundation for more advanced courses.
More details
Edition
4th edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 242 mm
Width: 209 mm
Thickness: 23 mm
Weight
1071 gr
ISBN-13
978-0-13-083143-9 (9780130831439)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Bernard Kolman | Robert C. Busby | Sharon Cutler Ross
Discrete Mathematical Structures
United States Edition
Book
11/2003
5th Edition
Pearson
€99.03
Article exhausted; check for reprint
Previous edition
Bernard Kolman | Robert C. Busby | Sharon Cutler Ross
Discrete Mathematical Structures
Book
02/1996
3rd Edition
Pearson
€37.13
Article exhausted; check for reprint
Content
1. Fundamentals.
Sets and Subsets. Operations on Sets. Sequences. Division in the Integers. Matrices. Mathematical Structures.
2. Logic.
Propositions and Logical Operations. Conditional Statements. Methods of Proof. Mathematical Induction.
3. Counting.
Permutations. Combinations. The Pigeonhole Principle. Elements of Probability. Recurrence Relations.
4. Relations and Digraphs.
Product Sets and Partitions. Relations and Digraphs. Paths in Relations and Digraphs. Properties of Relations. Equivalence Relations. Computer Representation of Relations and Digraphs. Operations on Relations. Transitive Closure and Warshall's Algorithm.
5. Functions.
Functions. Functions for Computer Science. Growth of Functions. Permutation Functions.
6. Order Relations and Structures.
Partially Ordered Sets. Extremal Elements of Partially Ordered Sets. Lattices. Finite Boolean Algebras. Functions on Boolean Algebras. Circuit Design.
7. Trees.
Trees. Labeled Trees. Tree Searching. Undirected Trees. Minimal Spanning Trees.
8. Topics in Graph Theory.
Graphs. Euler Paths and Circuits. Hamiltonian Paths and Circuits. Transport Networks. Matching Problems. Coloring Graphs.
9. Semigroups and Groups.
Semigroups. Products and Quotients of Semigroups. Groups. Products and Quotients of Groups.
10. Languages and Finite-State Machines.
Languages. Representations of Special Grammars. And Languages. Finite-State Machines. Semigroups, Machines, and Languages. Machines and Regular Languages. Simplification of Machines.
11. Groups and Coding.
Coding of Binary Information and Error Detection. Decoding and Error Correction.
Appendix A: Algorithms and Pseudocode.
Appendix B: Experiments in Discrete Mathematics.
Sets and Subsets. Operations on Sets. Sequences. Division in the Integers. Matrices. Mathematical Structures.
2. Logic.
Propositions and Logical Operations. Conditional Statements. Methods of Proof. Mathematical Induction.
3. Counting.
Permutations. Combinations. The Pigeonhole Principle. Elements of Probability. Recurrence Relations.
4. Relations and Digraphs.
Product Sets and Partitions. Relations and Digraphs. Paths in Relations and Digraphs. Properties of Relations. Equivalence Relations. Computer Representation of Relations and Digraphs. Operations on Relations. Transitive Closure and Warshall's Algorithm.
5. Functions.
Functions. Functions for Computer Science. Growth of Functions. Permutation Functions.
6. Order Relations and Structures.
Partially Ordered Sets. Extremal Elements of Partially Ordered Sets. Lattices. Finite Boolean Algebras. Functions on Boolean Algebras. Circuit Design.
7. Trees.
Trees. Labeled Trees. Tree Searching. Undirected Trees. Minimal Spanning Trees.
8. Topics in Graph Theory.
Graphs. Euler Paths and Circuits. Hamiltonian Paths and Circuits. Transport Networks. Matching Problems. Coloring Graphs.
9. Semigroups and Groups.
Semigroups. Products and Quotients of Semigroups. Groups. Products and Quotients of Groups.
10. Languages and Finite-State Machines.
Languages. Representations of Special Grammars. And Languages. Finite-State Machines. Semigroups, Machines, and Languages. Machines and Regular Languages. Simplification of Machines.
11. Groups and Coding.
Coding of Binary Information and Error Detection. Decoding and Error Correction.
Appendix A: Algorithms and Pseudocode.
Appendix B: Experiments in Discrete Mathematics.