Image from Google Jackets

Discrete Mathematical Structures.

By: Contributor(s): Material type: TextTextPublication details: Delhi: Pearson Education, c 2000.Edition: 4th ed. / Bernard Kolman, Robert C. Busby, Sharon Cutler RossDescription: xiv, 505 p. : ill. ; 24 cmISBN:
  • 0130831433
Subject(s): DDC classification:
  • 511/.6 21
LOC classification:
  • QA76.9.M35 K64 2000
Contents:
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Copy number Status Barcode
Books Library First Floor 1 Available 1738
Books Library First Floor 2 Available 1740
Books Library First Floor 3 Available 1741
Books Library First Floor 4 Available 1739
Books Library First Floor 5 Available 1742

Includes index.

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.

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.

There are no comments on this title.

to post a comment.
New Arrivals

Loading...

Contact Us

Library: Location maps

Phone: 00968 2323 7091 Email: Ask us a question

Library Hours

Sunday - Thursday 7:30AM - 8:00 PM

Friday - Saturday Closed