Amazon cover image
Image from Amazon.com

Discrete mathematics / Richard Johnsonbaugh.

By: Material type: TextTextPublisher: New York : Pearson, 2019Edition: Eighth edition, Global editionDescription: 767 pages : illustrations ; 26 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9781292233703
  • 1292233702
Subject(s): DDC classification:
  • 510 JO.D 2019 23
LOC classification:
  • QA39.2 .J65 2018
Contents:
Sets and Logic -- Proofs -- Functions, Sequences, and Relations -- Algorithms -- Introduction to Number Theory -- Counting Methods and the Pigeonhole Principle -- Recurrence Relations -- Graph Theory -- Trees -- Network Models -- Boolean Algebras and Combinatorial Circuits -- Automata, Grammars, and Languages -- Appendix A: Matrices -- Appendix B: Algebra Review -- Appendix C: Pseudocode
Summary: "An accessible introduction to the topics of discrete math, this best-selling text also works to expand students' mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topics serves to reinforce understanding. The text models various problem-solving techniques in detail, then provides opportunity to practice these techniques. The text also builds mathematical maturity by emphasizing how to read and write proofs. Many proofs are illustrated with annotated figures and/or motivated by special Discussion sections. The side margins of the text now include "tiny URLs" that direct students to relevant applications, extensions, and computer programs on the textbook website."Summary: For one- or two-term introductory courses in discrete mathematics. An accessible introduction to the topics of discrete math, this best-selling text also works to expand students' mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topic.
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 Collection Call number Status Date due Barcode
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 190321
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 192609
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 192610
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 192611
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 192612
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 192613
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 191999
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 190781
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 190782
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 190783
Books Books The Knowledge Hub Library Engineering 510 JO.D 2019 (Browse shelf(Opens below)) Available 190784

Includes bibliographical references (pages 647-651) and index.

Sets and Logic -- Proofs -- Functions, Sequences, and Relations -- Algorithms -- Introduction to Number Theory -- Counting Methods and the Pigeonhole Principle -- Recurrence Relations -- Graph Theory -- Trees -- Network Models -- Boolean Algebras and Combinatorial Circuits -- Automata, Grammars, and Languages -- Appendix A: Matrices -- Appendix B: Algebra Review -- Appendix C: Pseudocode

"An accessible introduction to the topics of discrete math, this best-selling text also works to expand students' mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topics serves to reinforce understanding. The text models various problem-solving techniques in detail, then provides opportunity to practice these techniques. The text also builds mathematical maturity by emphasizing how to read and write proofs. Many proofs are illustrated with annotated figures and/or motivated by special Discussion sections. The side margins of the text now include "tiny URLs" that direct students to relevant applications, extensions, and computer programs on the textbook website."

For one- or two-term introductory courses in discrete mathematics. An accessible introduction to the topics of discrete math, this best-selling text also works to expand students' mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topic.

There are no comments on this title.

to post a comment.