Discrete Mathematical Structures, Pearson New International Edition, 6th edition

Published by Pearson United Kingdom (July 23, 2013) © 2013

  • Bernard Kolman Drexel University
  • Robert Busby
  • Sharon C. Ross

eTextbook

£43.99

  • Easy-to-use search and navigation
  • Add notes and highlights
  • Search by keyword or page
£68.99

  • A print text (hardcover or paperback)
  • Free shipping

Discrete Mathematical Structures, Sixth Edition, offers a clear and concise presentation of the fundamental concepts of discrete mathematics. Ideal for a one-semester introductory course, this text contains more genuine computer science applications than any other text in the field.

This book is written at an appropriate level for a wide variety of majors and non-majors, and assumes a college algebra course as a prerequisite.

  • The focus on computer science prepares students for future computer science careers.
  • The emphasis on proof lays the foundation for mathematical thinking.
  • Clear organization of topics prevents students from being overwhelmed. The authors treat relations and digraphs as two aspects of the same fundamental idea, which is then used as the basis of virtually all the concepts introduced in the book.
  • Vignettes of mathematical history open each chapter, providing students with a practical background of how these ideas were developed.
  • Additional number theory coverage provides more information on the properties of integers, including base n representations, and gives more contexts for isomorphism.
  • Cryptology is explored throughout the book, introducing students to this exciting field.
  • Coverage of coding provides students with a full picture of all of its aspects, including efficiency, effectiveness, and security. A set of coding exercises for each chapter is also included in Appendix C.
  • Exercises emphasize multiple representations of concepts, and provide practice on reading and writing mathematical proofs.
  • Experiments provide opportunities for in-depth exploration and discovery, as well as for writing and for working in groups. Topics include weighted voting systems, Petri nets, Catalan numbers, and others.
  • End-of-chapter material includes Tips for Proofs, a summary of Key Ideas, and a Self-Test, which contains a set of conceptual review questions to help students identify and synthesize the main ideas of each chapter.
  • New sections on Logic, Mathematical Statements, and Logic and Problem Solving help students understand proofs and proof techniques. Additional exercises help students develop conjectures and how to prove or disprove them.
  • More applications, exercises, and figures have been added to help students learn and retain the material.
  • New material on fuzzy sets and fuzzy logic introduces students to a topic that is extremely important for modern issues of automated feedback and control of processes.
  • Popular puzzles like Sudoku and their underlying mathematical connections form a continuous thread in the text, connecting set theory, Boolean matrices, algorithms and coding, logic, the general construction of proofs, coloring problems and polynomials, and other topics in a way that students will find both interesting and instructive.

1. Fundamentals

1.1 Sets and Subsets

1.2 Operations on Sets

1.3 Sequences

1.4 Properties of Integers

1.5 Matrices

1.6 Mathematical Structures

 

2. Logic

2.1 Propositions and Logical Operations

2.2 Conditional Statements

2.3 Methods of Proof

2.4 Mathematical Induction

2.5 Mathematical Statements

2.6 Logic and Problem Solving

 

3. Counting

3.1 Permutations

3.2 Combinations

3.3 Pigeonhole Principle

3.4 Elements of Probability

3.5 Recurrence Relations 112

 

4. Relations and Digraphs

4.1 Product Sets and Partitions

4.2 Relations and Digraphs

4.3 Paths in Relations and Digraphs

4.4 Properties of Relations

4.5 Equivalence Relations

4.6 Data Structures for Relations and Digraphs

4.7 Operations on Relations

4.8 Transitive Closure and Warshall's Algorithm

 

5. Functions

5.1 Functions

5.2 Functions for Computer Science

5.3 Growth of Functions

5.4 Permutation Functions

 

6. Order Relations and Structures

6.1 Partially Ordered Sets

6.2 Extremal Elements of Partially Ordered Sets

6.3 Lattices

6.4 Finite Boolean Algebras

6.5 Functions on Boolean Algebras

6.6 Circuit Design

 

7. Trees

7.1 Trees

7.2 Labeled Trees

7.3 Tree Searching

7.4 Undirected Trees

7.5 Minimal Spanning Trees

 

8. Topics in Graph Theory

8.1 Graphs

8.2 Euler Paths and Circuits

8.3 Hamiltonian Paths and Circuits

8.4 Transport Networks

8.5 Matching Problems

8.6 Coloring Graphs

 

9. Semigroups and Groups

9.1 Binary Operations Revisited

9.2 Semigroups

9.3 Products and Quotients of Semigroups

9.4 Groups

9.5 Products and Quotients of Groups

9.6 Other Mathematical Structures

  

10. Groups and Coding

10.1 Coding of Binary Information and Error Detection

10.2 Decoding and Error Correction

10.3 Public Key Cryptology

 

11. Languages and Finite-State Machines

11.1 Languages

11.2 Representations of Special Grammars and Languages

11.3 Finite-State Machines

11.4 Monoids, Machines, and Languages

11.5 Machines and Regular Languages

11.6 Simplification of Machines

 

Appendix A: Algorithms and Pseudocode

Appendix B: Additional Experiments in Discrete Mathematics

Appendix C: Coding Exercises

Need help? Get in touch

Video
Play
Privacy and cookies
By watching, you agree Pearson can share your viewership data for marketing and analytics for one year, revocable by deleting your cookies.

Pearson eTextbook: What’s on the inside just might surprise you

They say you can’t judge a book by its cover. It’s the same with your students. Meet each one right where they are with an engaging, interactive, personalized learning experience that goes beyond the textbook to fit any schedule, any budget, and any lifestyle.Â