Discrete Mathematics [Hardcover]

Kenneth A. Ross (Author), Charles R. B. Wright (Author)

Book Description

ISBN-10: 0132181576 | ISBN-13: 978-0132181570 | Publication Date: January 9, 1992 | Edition: 3 Sub

This third edition offers an introduction to discrete mathematics, covering relations, induction, counting techniques, logic and graphs. More advanced topics of Boolean algebra and permutation groups are included, and there are numerous examples to reinforce the material.

Editorial Reviews

From the Publisher

Informal but thorough in its coverage, this introduction to discrete mathematics offers a carefully graded treatment of the basics essential to computer science.

From the Back Cover

Presenting conceptual chains in an orderly and gradual fashion, this informal but thorough introduction to discrete mathematics offers a careful treatment of the basics essential for computer science such as relations, induction, counting techniques, logic, and graphs. It also covers the more advanced topics of Boolean algebra and permutation groups, and comes with a wealth of examples to reinforce material and to allow readers to view topics from several perspectives. The book includes new coverage of probability that examines such areas as random variables and distributions and new sections on the Euclidean algorithm and loop invariants, providing a powerful tool for designing algorithms and verifying their correctness.

See all Editorial Reviews

Product Details

• Hardcover: 752 pages
• Publisher: Prentice Hall College Div; 3 Sub edition (January 9, 1992)
• Language: English
• ISBN-10: 0132181576
• ISBN-13: 978-0132181570
• Product Dimensions: 9.1 x 6.9 x 1.6 inches
• Shipping Weight: 2.7 pounds
• Average Customer Review: 1.7 out of 5 stars  See all reviews (17 customer reviews)
• Amazon Best Sellers Rank: #2,220,800 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

9 of 10 people found the following review helpful:

1.0 out of 5 stars terrible book, October 27, 2003

By A Customer

Amazon Verified Purchase

This review is from: Discrete Mathematics (5th Edition) (Paperback)

I keep thinking as I'm forced to use this book for a college course, that Discrete Math would not be so confusing to me if not for this textbook. With a good textbook, I believe the concepts would not be very difficult, but this book makes them so. True, they have many examples - very few of which cover the complex things you are then asked to do in the Exercises. If I could give it negative stars, I would, since it doesn't teach us but confuses us.

7 of 8 people found the following review helpful:

1.0 out of 5 stars Not every scholar should write for students., May 30, 2005

By 

ex student - See all my reviews

This review is from: Discrete Mathematics (5th Edition) (Paperback)

I was a student of Mr. Ross's, taking Discrete Math, a few years ago. He's is a very intelligent man and seemed to enjoy teaching. Unfortunately, he was not very good at it. And same goes for this text book of his. His attitude and approach in the classroom and the book's alike might be helpful if the student has already mastered the majority of the covered topics, in which case, this book becomes useless.

7 of 8 people found the following review helpful:

1.0 out of 5 stars This book belongs in the fireplace!, May 12, 1999

By A Customer

This review is from: Discrete Mathematics (Hardcover)

I do not recommend this to anyone trying to learn discrete mathematics for the first time (or any other time). The author of this book leaves out much too many details. This book is much too vague. Even the solutions provided are brief. Not much insight, not enough examples. Combine this book with a bad teacher, and you will have an extra difficult time passing a discrete math course. Why should about one-fourth of the students take this course 2 or more times? This book could be used for reference, but why bother? Get a better book instead. Look elsewhere for better explanation of the concepts so important to computer science.