- Hardcover: 11 pages
- Publisher: Brooks Cole; 3rd Ed edition (5 Dec 2003)
- Language English
- ISBN-10: 0534359450
- ISBN-13: 978-0534359454
- Product Dimensions: 25.7 x 20.1 x 3 cm
- Amazon Bestsellers Rank: 4,759,093 in Books (See Top 100 in Books)
- See Complete Table of Contents
| ||||||||||||||||||
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Plus, get an extra £5 Gift Certificate when you trade in books worth £10 or more before June 30, 2012. Visit the Books Trade-In Store for more details. |
|
There is a newer edition of this item:
|
Product details |
More About the Author
Product Description
Synopsis
This textbook for computer science and math majors describes processes that consist of a sequence of individual steps, and explains the concepts of logic, proof, induction, recursion, algorithms, and discrete structures. The third edition adds a chapter on finite-state automata, and sections on modu
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 organise and find favourite items. |
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
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
35 reviews
55 of 56 people found the following review helpful
Great text on discrete mathematics especially for non-math majors
9 Aug 2006
Format:Hardcover
I used an earlier edition of this textbook in a discrete mathematics class that was required for those of us with a non-CS background enrolled in a MSCS program at Virginia Tech, and I found this to be an excellent and complete book on the subject. If you find yourself enrolled in a class using this book, you can be sure of two things - your instructor knows how to select good textbooks and also it won't matter if your instructor is a good teacher since this book does all of the work for him/her.
If you are enrolled in a class on discrete math and this textbook is not assigned, might I suggest you get a used copy of the previous edition. It is just as good as this current edition and used copies can easily be found dirt cheap. If you buy a copy of a previous edition the topics you'd be missing that are new to this edition would be expected value, conditional probability, Bayes' theorem, modular arithmetic, Fermat's little theorem and the Chinese remainder theorem, and RSA cryptography.
The author has included illuminating examples of all concepts throughout the textbook, defined all terms, and makes sure that each new concept introduced builds on previously explained material. Subjects covered include the logic of computation, including the predicate logic that is necessary for fully understanding artificial intelligence, methods of proof including the method of induction and also the terminology of sequences, number theory and combinatorics, O-notation and the calculation of the efficiency of algorithms, graph theory and discrete structures, and an introduction to concepts from the theory of computation. There are many exercises included, with the solutions to selected exercises in the back of the book.
This book only assumes mathematical maturity at the level of precalculus, excluding trigonometry. I highly recommend this text especially to students who are transitioning to computer science from some other discipline and need a firm foundation in the basics of that field. You'll find it useful as a foundational text for studying artificial intelligence, the theory of algorithms, mathematical models of computation, and the theory of computation. Another useful book on this subject is the "Schaum's Outline of Discrete Mathematics".
The table of contents are as follows:
1. The Logic of Compound Statements
2. The Logic of Quantified Statements
3. Elementary Number Theory and Methods of Proof
4. Sequences and Mathematical Induction
5. Set Theory
6. Counting
7. Functions
8. Recursion
9. O-Notation and the Efficiency of Algorithms
10. Relations
11. Graphs and Trees
12. Finite State Automata and Applications
If you are enrolled in a class on discrete math and this textbook is not assigned, might I suggest you get a used copy of the previous edition. It is just as good as this current edition and used copies can easily be found dirt cheap. If you buy a copy of a previous edition the topics you'd be missing that are new to this edition would be expected value, conditional probability, Bayes' theorem, modular arithmetic, Fermat's little theorem and the Chinese remainder theorem, and RSA cryptography.
The author has included illuminating examples of all concepts throughout the textbook, defined all terms, and makes sure that each new concept introduced builds on previously explained material. Subjects covered include the logic of computation, including the predicate logic that is necessary for fully understanding artificial intelligence, methods of proof including the method of induction and also the terminology of sequences, number theory and combinatorics, O-notation and the calculation of the efficiency of algorithms, graph theory and discrete structures, and an introduction to concepts from the theory of computation. There are many exercises included, with the solutions to selected exercises in the back of the book.
This book only assumes mathematical maturity at the level of precalculus, excluding trigonometry. I highly recommend this text especially to students who are transitioning to computer science from some other discipline and need a firm foundation in the basics of that field. You'll find it useful as a foundational text for studying artificial intelligence, the theory of algorithms, mathematical models of computation, and the theory of computation. Another useful book on this subject is the "Schaum's Outline of Discrete Mathematics".
The table of contents are as follows:
1. The Logic of Compound Statements
2. The Logic of Quantified Statements
3. Elementary Number Theory and Methods of Proof
4. Sequences and Mathematical Induction
5. Set Theory
6. Counting
7. Functions
8. Recursion
9. O-Notation and the Efficiency of Algorithms
10. Relations
11. Graphs and Trees
12. Finite State Automata and Applications
24 of 24 people found the following review helpful
Comparison of the top 3 Discrete Math Texts
24 May 2009
Format:Hardcover
I have read "Discrete Mathematics" by Epp, Rosen and Ross which are the three most common discrete math texts that I encounter at university.
Of these three, I would rate Epp's book as my favorite because it has the clearest explanations and is so easy to read that you can't help but feel like you understand all of the content completely. The only failing that Epp's book might have is that it is not as thorough in its coverage of the material as some of the more technical books. I would say that it covers about 90% of the material and leaves out some of the more obscure topics.
Rosen's book would be the most thorough, covering every topic in meticulous detail and offering a jumping point for other texts in cryptography and number theory. Although this book is more complete than Epp's, it is also less readable and requires more effort to get through. Ideally you would use Epp's book to learn the material and then go to Rosen's book for a technical reference.
For those of you who are considering Ross's book, I have one thing to say and that is don't. Although I have read this book and done a lot of the problems in the first 3/4 of the text, this book is neither clear in its explanations like Epp nor is it as complete as Rosen's book. If you are assigned this book for a course, my suggestion would be to buy Epp's book and photocopy the Ross homework problems from a friend's textbook.
Take the advice of someone who has read all three books. If you have to buy just one, then get the Epp book. It is better to understand 90% of the material completely rather than 100% of the material partially.
Of these three, I would rate Epp's book as my favorite because it has the clearest explanations and is so easy to read that you can't help but feel like you understand all of the content completely. The only failing that Epp's book might have is that it is not as thorough in its coverage of the material as some of the more technical books. I would say that it covers about 90% of the material and leaves out some of the more obscure topics.
Rosen's book would be the most thorough, covering every topic in meticulous detail and offering a jumping point for other texts in cryptography and number theory. Although this book is more complete than Epp's, it is also less readable and requires more effort to get through. Ideally you would use Epp's book to learn the material and then go to Rosen's book for a technical reference.
For those of you who are considering Ross's book, I have one thing to say and that is don't. Although I have read this book and done a lot of the problems in the first 3/4 of the text, this book is neither clear in its explanations like Epp nor is it as complete as Rosen's book. If you are assigned this book for a course, my suggestion would be to buy Epp's book and photocopy the Ross homework problems from a friend's textbook.
Take the advice of someone who has read all three books. If you have to buy just one, then get the Epp book. It is better to understand 90% of the material completely rather than 100% of the material partially.
31 of 33 people found the following review helpful
Almost perfect.....
23 Oct 2004
Format:Hardcover
For anyone having a bit of a problem getting used to formal proofs and number theory, this book is the best I've seen for the beginner, hands down. If you've gotten into one of the top math programs in the country, you will do OK without this book; but as for the rest of us, this book may prevent a lot of grief. It moves slowly and clearly through basic methods of proof and number theory, and it builds confidence quickly. Dr. Epp has written a great book, and the only drawback (which isn't her fault) is the price. If you are pretty good at math through Calculus but got thrown for a loop trying to understand proofs and more formal mathematics, this is probably the book for you (as it was for me).
Were these reviews helpful?
Let us know
Listmania!
Look for similar items by category
- Books > Computing & Internet > Computer Science
- Books > Science & Nature > Mathematics > Calculus & Mathematical Analysis
- Books > Science & Nature > Mathematics > Discrete Mathematics
- Books > Science & Nature > Mathematics > Education > Higher Education
- Books > Science & Nature > Popular Science > Maths
- Books > Scientific, Technical & Medical
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
