|

Addison-Wesley / Prentice Hall

Mathematics

My Instructor Resource Center :  Log in or request access

Discrete Mathematical Structures, 4/E
Bernard KolmanDrexel University
Robert C. BusbyDrexel University
Sharon Cutler RossGeorgia Perimeter College

ISBN-10: 0130831433
ISBN-13:  9780130831439

Publisher:  Pearson
Copyright:  2000
Format:  Cloth; 505 pp
Published:  11/23/1999

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.

  • NEW - More emphasis on proofs—Includes a “Tips on Proofs” unit in each chapter. The new unit discusses the proof techniques associated with the topics of that chapter.
    • Offers students more dialogue about reading, understanding, and constructing proofs. Ex.___

  • NEW - Extensively redesigned exercise sets—More routine exercises as well as more challenging problems are given. The dialogue on proof and proof techniques continues here with exercises that require students to complete partial proofs and analyze proof strategies. More exercises require explanations or justifications.
  • NEW - Chapter Tests—Solutions to all questions supplied.
    • Gives students the opportunity to self test their knowledge of chapter concepts. Ex.___

  • NEW - The different ways of representing relations are more thoroughly exploited.
    • Enables students with different learning styles to master the concepts. Ex.___

  • NEW - Additional sections in the graph theory chapter covering transport networks and their applications.
  • Still the briefest text on the market. An accessible, concise, and interesting narrative—Devoid of excessive technical jargon and abstraction.
    • Helps students focus on fundamental concepts without becoming bogged down in special cases, weakly motivated examples, and applications. Enables instructors to sharpen focus on key ideas and concepts. Ex.___

  • Experiments—Suitable for individual work or group projects.
    • Gives students the opportunity to work with an open-ended problem, to develop and test conjectures, communicate their work and build confidence in their problem-solving skills. Experiments also foster better conceptual understanding. Ex.___

  • Only a limited background in mathematics required—No calculus.
    • Offers students a level of rigor appropriate for beginners. Ex.___

  • Algorithms and pseudocode used throughout the text to illustrate techniques.
  • Systematic approach—Introduces each new concept using previously encountered material.
    • Provides students with material developed in such a way to simplify the more complex ideas that follow and lead naturally to other algebraic structures. Ex.___

  • Coding exercises—Provided in each chapter.
    • Relate discrete mathematics topics to students' programming experience. Can also be used in developing programming ideas and skills before a programming course. Ex.___

  • Organization of topics around the concept of a relation—Treats relations and digraphs as two aspects of the same basic mathematical idea.
    • This fundamental idea is then used as the basis for all the concepts introduced—including functions, partial orders, graphs, and algebraic structures. Ex.___

  • A focus on topics of genuine use in computer science.
    • Limits coverage of abstract algebra and gives applications to the important topics of finite state machines, and error correcting and detecting codes. Ex.___

  • More emphasis on proofs—Includes a “Tips on Proofs” unit in each chapter. The new unit discusses the proof techniques associated with the topics of that chapter.
    • Offers students more dialogue about reading, understanding, and constructing proofs. Ex.___

  • Extensively redesigned exercise sets—More routine exercises as well as more challenging problems are given. The dialogue on proof and proof techniques continues here with exercises that require students to complete partial proofs and analyze proof strategies. More exercises require explanations or justifications.
  • Chapter Tests—Solutions to all questions supplied.
    • Gives students the opportunity to self test their knowledge of chapter concepts. Ex.___

  • The different ways of representing relations are more thoroughly exploited.
    • Enables students with different learning styles to master the concepts. Ex.___

  • Additional sections in the graph theory chapter covering transport networks and their applications.



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.

  • 9780132297516
    Discrete Mathematical Structures, 6/E
    Kolman, Busby & Ross
    ©2009 | Pearson | Cloth; 552 pp | Instock
    ISBN-10: 0132297515 | ISBN-13: 9780132297516
    Brief Description

For the Mathematics Discipline

Addison-Wesley's Algebra Review
Addison-Wesley
©2004 | Pearson | Paper | Instock
ISBN-10: 0321247086 | ISBN-13: 9780321247087


Addison-Wesley's Basic Math Review
Addison-Wesley
©2004 | Pearson | Paper | Instock
ISBN-10: 0321247078 | ISBN-13: 9780321247070


Algebra Review Study Card, 2/E
D'Ippolito & Generazzo
©2006 | Pearson | Study Card; 6 pp | Instock
ISBN-10: 0321394739 | ISBN-13: 9780321394736


Allied Health Study Card, 2/E
Forshier
©2006 | Pearson | Study Card | Instock
ISBN-10: 0321394747 | ISBN-13: 9780321394743


Basic Math Review Card, 2/E
Addison-Wesley
©2006 | Pearson | Study Card; 6 pp | Instock
ISBN-10: 0321394763 | ISBN-13: 9780321394767


Concept Videos: Algebra
Addison-Wesley
©2008 | Pearson | Multiple Media Package | Instock
ISBN-10: 0321517199 | ISBN-13: 9780321517197


Concept Videos: Basic Math & Prealgebra
Addison-Wesley
©2008 | Pearson | Multiple Media Package | Instock
ISBN-10: 032151758X | ISBN-13: 9780321517586


Discovering Algebra: Examples with Keystrokes on the TI-83/TI-82 and TI-85/TI-86, A Laboratory Approach
Pirich & Bigliani
©1997 | Pearson | Paper; 195 pp | Instock
ISBN-10: 0136492037 | ISBN-13: 9780136492030


Finite Mathematics Study Card
Addison-Wesley
©2006 | Pearson | Study Card | Instock
ISBN-10: 0321374398 | ISBN-13: 9780321374394


Flash Review Series: Algebra
Becker
©2004 | Pearson | Paper | Instock
ISBN-10: 0321143094 | ISBN-13: 9780321143099


Graphing Calculator Reference Card, 3/E
Ripley
©2006 | Pearson | Study Card; 6 pp | Instock
ISBN-10: 0321394755 | ISBN-13: 9780321394750


Graphing Calculator Tutorial CD
Addison-Wesley
©2006 | Pearson | CD-ROM Only | Instock
ISBN-10: 0321357744 | ISBN-13: 9780321357748


Math for Allied Health Study/Reference Card
Forshier
©2006 | Pearson | Study Card; 0 pp | Out of Stock
ISBN-10: 0321336542 | ISBN-13: 9780321336545


Mathematics Spanish Glossary, 2/E
Lara & Peeples
©2000 | Pearson | Paper; 48 pp | Instock
ISBN-10: 0201728966 | ISBN-13: 9780201728965


Overcoming Math Anxiety, 2/E
Davidson & Levitov
©2000 | Pearson | Paper | Instock
ISBN-10: 0321069188 | ISBN-13: 9780321069184


Pearson TI Rebate Coupon $15, 2/E
Pearson
©2009 | Pearson | Paper | Instock
ISBN-10: 0321566041 | ISBN-13: 9780321566041


Prealgebra Review Workbook
Wheel
©2006 | Pearson | Paper; 300 pp | Instock
ISBN-10: 0321473329 | ISBN-13: 9780321473325


Review of Algebra, A
Howard
©2002 | Pearson | Paper; 224 pp | Instock
ISBN-10: 0201773473 | ISBN-13: 9780201773477


Saleable Technology Bundle, 2/E
Pearson
©2009 | Pearson | Multiple Media Package | Estimated Availability : 09/01/2008
ISBN-10: 0321561880 | ISBN-13: 9780321561886


Spanish Basic Math Study Card
Leonarte
©2007 | Pearson | Study Card | Instock
ISBN-10: 0321438582 | ISBN-13: 9780321438584


Stand-alone Access Code Tutor Center
Addison-Wesley
©2008 | Pearson | Access Code Card | Instock
ISBN-10: 0201721708 | ISBN-13: 9780201721706


Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.