Discrete and Combinatorial Mathematics: An Applied Introduction: Amazon.ca: Ralph P. Grimaldi: Books

Product Description

Book Description

Suitable for discrete math, combinatories, graph theory, and modern applied algebra courses. Very thorough, useful reference for any applied science or computer science student.

Features and Benefits

Appropriate for four different courses- Discrete Mathematics; Combinatorics; Graph Theory; Modern Applied Algebra.
Flexible, modular organization.
This text has an enhanced mathematical approach, with carefully thought out examples, including many examples with computer sciences applications.
Carefully thought-out examples, including examples with computer science applications. Students can learn by reading the text.
The Fourth Edition has added more elementary problems, creating a larger variety of level within the problem sets which allows students to establish skills as they practice.
Chapter summaries allow the student to review what they have learned, while historical reviews and biographies bring a human element to their assignments.

Tag this product

(What's this?)

Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.

Customer Reviews

19 Reviews

5 star:		(4)
4 star:		(7)
3 star:		(0)
2 star:		(4)
1 star:		(4)

Average Customer Review

3.2 out of 5 stars (19 customer reviews)

Share your thoughts with other customers:

Create your own review

Most helpful customer reviews

4.0 out of 5 stars Why you should use this book for your year1 discrete math course, Mar 26 2012

By

Alexandru - See all my reviews

Amazon Verified Purchase(What's this?)

This review is from: Discrete and Combinatorial Mathematics (Hardcover)

This is a very good book for beginners at discrete mathematics. Many first year courses in discrete math usually focus on two or three major topics: combinatorics and finite automata, recurrence and generating functions, and graph theory. The good thing about this book it that it covers all of it in good detail for a undergrad course. Therefore the professor has the option of picking the material he thinks will be interesting or maybe easier to understand for the students from a vast collection of topics (with many exercises). The exercises also include some which are related to programming/cs and so the book is also good for cs students. There's also a section at the end which includes modern discrete mathematics which is more or less a bit of abstract algebra(modular arithmetic,rings,fields) and groups with various applications to modern fields such as cryptography, networks, digital switches, and more "mathy" applications such as latin squares and finite fields.

The cons of this book is that it's quite large and heavy(over 800 pages), and it is quite pricy, but it makes up for it by having a good structure exercises of various difficulties. (so it's not perfect but it's quite good, hence the 4 star rating)

Overall this is a worthy purchase for a first year student who wants to find out what discrete math is, or a professor who wants a large book full of different topics which are not at a too high level while at the same time being challenging enough for a 1st or 2nd year course.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

2 of 2 people found the following review helpful

1.0 out of 5 stars Do Not Buy This Book, Dec 15 2002

By

A City College Student (New York, NY USA) - See all my reviews

This review is from: Discrete and Combinatorial Mathematics: An Applied Introduction (Hardcover)

This book is intended for graduate students and professors of Mathematics who knew the subjet well already. The author made the subject unnecessarily complicated and explanations of the concepts are not adequate for first year CS students. It is not a book to rely on for self-study unless you have plenty of time, other text books and basic background on the subject. Contrary to the preface, I believe, the author intended to show off his math knowledge without consideration for the people who wants to learn.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

1 of 1 people found the following review helpful

1.0 out of 5 stars This is unreadable, Sep 29 2002

By

Jo Totland (Oslo, Oslo Norway) - See all my reviews

This review is from: Discrete and Combinatorial Mathematics: An Applied Introduction (Hardcover)

There is no doubt Grimaldi must have been paid per page, because if quality mattered at all, the book would have been cut down to around 200 pages, and it would still be an easy read for first-year students. The redundancy and amount of trivial examples is so overwhelming that actually finding any content becomes like a search for a needle in a haystack.

This is unfortunate, becase what the book covers is rather interesting.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

Share your thoughts with other customers: Create your own review

› See all 19 customer reviews on Amazon.ca

Want to see more reviews on this item?

› Go to Amazon.com to see all 36 reviews 3.6 out of 5 stars

Most recent customer reviews

1.0 out of 5 stars Worst textbook ever
You know those math textbooks that are written the way one math professor would talk to another and your instructor loves the book because it's so precise and succinct? Read more

Published on Jan 15 2007 by Scott Bishop

1.0 out of 5 stars good!!
It is class book