Fundamentals of Discrete Structures

by ; ; ;
  • ISBN13:


  • ISBN10:


  • Edition: 2nd
  • Format: Paperback
  • Copyright: 2012-08-21
  • Publisher: Pearson Learning Solutions

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $112.60 Save up to $22.52
  • Rent Book $90.08
    Add to Cart Free Shipping


Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


Selecting a mathematics textbook that meets the needs of a diverse student body can be a challenge. Some have too much information for a beginner; some have too little. The authors of Fundamentals of Discrete Structures, frustrated by their search for the perfect text, decided to write their own. The result provides an excellent introduction to discrete mathematics that is both accessible to liberal arts majors satisfying their core mathematics requirements, and also challenging enough to engage math and computer science majors. To engage students who may not be comfortable with traditional mathematics texts, the book uses a light tone when introducing new concepts. While there is an emphasis on computation, it avoids mathematical formalism and formal proofs, thus making it easier for the average student to understand. Unlike other textbooks in this field, Fundamentals of Discrete Structuresstrikes just the right balance: it illuminates the essentials of discrete mathematics while still providing a comprehensive treatment of the subject matter.

Author Biography

  • Damian Lyons earned his Ph.D. in Computer Science from the University of Massachusetts at Amherst in 1986. The recipient of numerous Philips Research awards, he is also the inventor/co-inventor on 14 U.S. patents and 7 European patents for work in robotics and computer vision. He is a professor at Fordham University.
  • Christina Papadakis-Kanaris was awarded her M.S. in Computer Science from Fordham University in 2006. She now teaches at Fordham University.
  • Gary Weiss received his Ph.D. in Computer Science from Rutgers University in 2003. He serves on the editorial board of the International Journal of Data Mining, Modelling, and Management, and he has received awards for his work in artificial intelligence and data mining. He is a professor at Fordham University.
  • Arthur Werschulz earned his Ph.D. in mathematics from Carnegie-Mellon University in 1977. He is the author and co-author of several books on mathematics. He also serves on the editorial board of the Journal of Complexity. He is a professor at Fordham University.

Table of Contents

1.       Introduction

2.       Sets and Sequences

3.       Logic

4.       Relations

5.       Functions

6.       Counting

7.       Probability

8.       Algorithms

9.       Graphs

Rewards Program

Write a Review