Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition | 
 enlarge | Author: Ralph P. Grimaldi
Publisher: Addison Wesley
Category: Book
List Price: $133.33
Buy Used: $71.00
You Save: $62.33 (47%)
New (16) Used (18) from $71.00
Rating:  26 reviews
Sales Rank: 623437
Media: Hardcover
Edition: 5
Pages: 24
Number Of Items: 1
Shipping Weight (lbs): 4.4
Dimensions (in): 10.1 x 8.3 x 1.7
ISBN: 0201726343
Dewey Decimal Number: 510
EAN: 9780201726343
Publication Date: July 27, 2003
Availability: Usually ships in 1-2 business days
| |
| Accessories:
|
| Similar Items:
|
| Editorial Reviews:
Product Description
This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study.
|
| Customer Reviews: Read 21 more reviews...
 #1 discrete math book April 3, 2004
9 out of 9 found this review helpful
The book is very well-written, clear and precise. I have read a couple of other books for discrete math courses, but found nothing exciting there; mostly frustrating errors, bad examples and confusion. Grimaldi's book covers pretty much everything you need to understand and apply in Discrete Mathematics. The exercises are well designed, in increasing difficulty. For most of the exercises, one can find similar examples in the text. Parts 1 and 2 of the book are by far the best read in Fundamentals and Enumeration I have ever encountered. Section 11 of Part 3 is a very nice introduction to Graph Theory. My only suggestion for improvement is some revision of sections 12 and 13 on graph algorithms - these can be simplified in terms of notation and description. Part 4 is for more advanced readers; it is usually used in a second course in Discrete mathematics. However, without being as exhaustive as the first three parts, the fourth part is presented with the same clarity and detail as the other three. I would strongly recommend this book not only to anyone who teaches Discrete mathematics, but also to any student who studies Discrete mathematics from a different book. If you are frustrated about the material; Grimaldi's book would give you the understanding and clarity you need. Definitely a five star product!
ideal for self study January 26, 2006
Tomas Selnekovic (Bratislava, SLOVAKIA)
7 out of 7 found this review helpful
Excellent book, carefully chosen examples, ideal for self study. I like it very much. My advice is not to skip any section or solved examples or you might be lost.
Excellent introductory discrete math text October 22, 2002
David Elder (Boston, Ma United States)
8 out of 9 found this review helpful
Grimaldi has produced a wonderful book. All the important topics in discrete math are explored, with many applications to computer science, the main client field of discrete math. The text is well balanced between theory and application. Especially nice is the introduction to modern algebra, with applications to coding theory. I highly recommend this text to anyone wishing to explore discrete mathematics. A good understanding of the concepts presented by Grimaldi will prepare the reader for more advanced work in discrete math (Aigner), computer science (Knuth), or theory of computation (Sipser).
great book on discrete math March 21, 2005
Quailster
2 out of 2 found this review helpful
This is an excellent book for self study. However, there are parts in this book that must be rearranged or deleted. For example, I think Catalan numbers should be deleted. This might be useful for the matrix chaining problem, but that's in the realms of algorithm design (specifically in dynamic programming). Also, I do not understand why Grimaldi sandwiched in a chapter on Finite State Machines between two chapters on Functions and Relations. Maybe he should make a section on languages for FSMs, but I recommend Sipser's Introduction to the Theory of Computation if you want to learn about FSMs.
Excellent book for an introduction to Advanced Algebra May 4, 1998
Fernando G. del C (Houston, TX United States)
3 out of 4 found this review helpful
Plenty of excercises and answers. Very well explained; this book is a must for those who want to learn combinatorics, elementary graph theory, and many other extremely useful topics.
|
|
|
