Discrete Mathematics (Classic Version), 5th edition

Published by Pearson (March 7, 2017) © 2018

  • John A. Dossey
  • Albert D. Otto
  • Lawrence E. Spence Illinois State University
  • Charles Vanden Eynden
Products list

Details

  • A print text

For 1-semester introductory courses in Discrete Mathematics.

A modern classic

An ever-increasing percentage of mathematic applications involve discrete rather than continuous models. The strong algorithmic emphasis of Discrete Mathematics, 5th Edition is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.

This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price.

  • 1: An Introduction to Combinatorial Problems and Techniques
  • 2: Sets, Relations, and Functions
  • 3: Coding Theory
  • 4: Graphs
  • 5: Trees
  • 6: Matching
  • 7: Network Flows
  • 8: Counting Techniques
  • 9: Recurrence Relations and Generating Functions
  • 10: Combinatorial Circuits and Finite State Machines
  • Appendix A: An Introduction to Logic and Proof
  • Appendix B Matrices
  • Historical Notes
  • Appendix C The Algorithms in This Book
  • Bibliography
  • Answers to odd-numbered exercises
  • Index

Need help? Get in touch