Have one to sell? Sell yours here
Discrete Mathematics and Its Applications (McGraw-Hill International Editions: Mathematics Series)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Discrete Mathematics and Its Applications (McGraw-Hill International Editions: Mathematics Series) [Import] [Paperback]

Kenneth Rosen (Author)
3.3 out of 5 stars  See all reviews (54 customer reviews)


Available from these sellers.


Formats

Amazon Price New from Used from
Hardcover --  
Paperback --  
Paperback, Import, June 1999 --  


Product Details

  • Paperback: 832 pages
  • Publisher: McGraw-Hill Education (ISE Editions); Internat.2r.e. edition (June 1999)
  • Language: English
  • ISBN-10: 0071167560
  • ISBN-13: 978-0071167567
  • Product Dimensions: 9.5 x 7.2 x 1.8 inches
  • Shipping Weight: 2.3 pounds
  • Average Customer Review: 3.3 out of 5 stars  See all reviews (54 customer reviews)
  • Amazon Best Sellers Rank: #2,629,448 in Books (See Top 100 in Books)

More About the Author

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

 

Customer Reviews

54 Reviews
5 star:
 (20)
4 star:
 (10)
3 star:
 (3)
2 star:
 (6)
1 star:
 (15)
 
 
 
 
 
Average Customer Review
3.3 out of 5 stars (54 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

46 of 51 people found the following review helpful:
4.0 out of 5 stars The best Discrete Math book, but..., January 6, 2001
By 
Jonathan D. Decarlo (Thomaston, Connecticut USA) - See all my reviews
(REAL NAME)   
This is probably the best Discrete Math book that I have found. It's very thorough and covers all the topics of Discrete Mathematics that one would expect it to. There is a proof for most major theorems and numerous examples.

The "but..." is that this book, like almost every math text that I have ever come across, is NOT very readable and gets EXTREMELY boring at parts. I would say that math books can only be so interesting, but I have come across one math text that I honestly enjoyed from beginning to end: "Linear Algebra and Its Applications," by Lay. That book is proof that it can be done, but this book sure isn't.

Also, one last word of advise... I found that the student solutions guide that was written for this text is a must have. It has the worked out solutions to many of the books problems, which is a big help considering that Discrete Math is all about how you found the answer.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


44 of 49 people found the following review helpful:
2.0 out of 5 stars Mediocre book costs a fortune, September 27, 2002
By A Customer
Discrete mathematics is a difficult subject. If God himself wrote the best book there could ever be on Discrete Mathematics, and if God was your professor, believe me, it would still be a hard class. The point is: the subject matter is difficult to grasp and this book does little to help you understand anything.

This book is not very good. Here's why: It does not explain Big-0, Big-Omega, Big Theta and other important topics. The author gives the formal definition, but does NOT provide any worked out solutions from which you can follow and learn. In the back of each section where all the problems are listed, the author introduces NEW material that is VERY important to know. So you have to play "detective" with this book and take a "forensic" approach if you want to learn anything. The book tells you to look a few sections ahead to find a definition that will allow you to solve a problem in the current section. The author uses MANY run-on sentences in the book when trying to explain important concepts. Some sections are good though. The sections on logic and sets are good because they actually HAVE worked out problems that are systematic and don't skip steps.

Why can't you just pick up a book, read it and learn? If that's what you want to do, this book's not for you. If you want to spend hours and hours in the library reading over and over but not learning much, then I suggest you buy this book.

If you are the type of person who learns best by reading a textbook and doing the exercises, don't waste your money on this book because the section on the "Growth of Functions" has NOT ONE example of how to prove if f(x) is O( g(x) ), or if f(x) is big-Omega( g(x) ), or if f(x) is big-Theta( g(x) ), for example. The book has all the formal definitions written down for you, but no problems are worked out algebraically. It does not point out the common pitfalls or anything like that either.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


16 of 18 people found the following review helpful:
5.0 out of 5 stars A must have companion to Rosen's book, January 6, 2001
By 
Jonathan D. Decarlo (Thomaston, Connecticut USA) - See all my reviews
(REAL NAME)   
The other reviewer was obviously talking about "Discrete Math and Its Applications," which is the actual text book. This book is the student solutions guide for that text. So don't buy this book thinking that it is a text book, because this book was only meant to suppliment the text.

I found that this guide was a must have companion to "Discrete Math and Its Applications." It has the worked out solutions to many of the exercises in the text, which is very helpful. All-in-all, a definite must-have suppliment to the text.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews











Only search this product's reviews



Inside This Book (learn more)
Browse and search another edition of this book.
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
generating functions, recurrence relations, handshake theorem, planar graphs, sleepy hare, intransitive verb adverb, main inner loops, generalized pigeonhole principle, bracketed symbols, edge chromatic number, assume the inductive hypothesis, nonisomorphic trees, given recurrence relation, ternary strings, solving recurrence relations, resulting directed graph, symmetric closure, outermost operator, next permutation, computer algebra package, nth month, recursive part, prenex form, writing these essays, decreasing subsequence
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Writing Project, The Foundations, Advanced Counting Techniques, Mathematical Reasoning, New York, The Fundamentals, San Francisco, Modeling Computation, Boolean Algebra, Finite-State Machines, Los Angeles, Term String, Kevin Bacon, Mathematical Reviews, Fundamental Theorem of Arithmetic, Recursive Definitions, Methods of Proof, The Basics of Counting, Step Reason, New Jersey, Closures of Relations, Probability Theory, Kuratowski's Theorem, Applications of Number Theory, Partial Orderings
New!
Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Search Inside This Book:


What Other Items Do Customers Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums





Look for Similar Items by Category


Look for Similar Items by Subject

Search Books by subject:




i.e., each book must be in subject 1 AND subject 2 AND ...