Discrete Mathematical Structures

International Edition

Bernard Kolman, Robert C. Busby, Sharon Cutler Ross (Autoren)

Buch | Softcover

528 Seiten

2003 | 5th edition
Pearson (Verlag)
978-0-13-123046-0 (ISBN)

Titel erscheint in neuer Auflage

Artikel merken

Suitable for one- or two-term freshman/sophomore-level courses in Discrete Mathematics, this text limits its area and coverage of topics to those that students actually utilize. It emphasizes on both basic theory and applications, giving a foundation for more advanced courses, as well as providing a useful reference work for those courses.

For one- or two-term freshman/sophomore-level courses in Discrete Mathematics.

Combining a careful selection of topics with previews of their genuine applications in computer science, this text, more than any other book in its field, is written at an elementary level with a strong pedagogical focus. It limits its area and coverage of topics to those that students will actually utilize, and emphasizes both basic theory and applications, giving a firm foundation for more advanced courses, as well as providing an excellent reference work for those courses.

1. Fundamentals.

Sets and Subsets. Operations on Sets. Sequences. Properties of Integers. Matrices. Mathematical Structures.

2. Logic.

Propositions and Logical Operations. Conditional Statements. Methods of Proof. Mathematical Induction.

3. Counting.

Permutations. Combinations. 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.

Binary Operations, Revisited. 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. Public Key Cryptology.

Appendix A: Algorithms and Pseudocode.

Appendix B: Additional Experiments in Discrete Mathematics.

Answers to Odd-Numbered Exercises.

Answers to Chapter Tests.

Index.

Erscheint lt. Verlag	13.11.2003
Sprache	englisch
Maße	203 x 254 mm
Gewicht	928 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Graphentheorie
ISBN-10	0-13-123046-8 / 0131230468
ISBN-13	978-0-13-123046-0 / 9780131230460
Zustand	Neuware