Schaum's Outline of Discrete Mathematics (Schaum's) | 
 enlarge | Authors: Seymor Lipschutz, Marc Lipson
Publisher: McGraw-Hill
Category: Book
List Price: $16.95
Buy Used: $1.35
You Save: $15.60 (92%)
New (15) Used (41) from $1.35
Rating:  8 reviews
Sales Rank: 96390
Media: Paperback
Edition: 2
Pages: 528
Number Of Items: 1
Shipping Weight (lbs): 2.2
Dimensions (in): 10.8 x 8.2 x 1
ISBN: 0070380457
Dewey Decimal Number: 512.02
EAN: 9780070380455
Publication Date: June 1, 1997
Availability: Usually ships in 1-2 business days
Condition: Like New Condition, Shelf Wear, Tight Binding, Pages are Clean and Unread , Immediate Shipping, Email Notification, Professional Service, MILLIONS Served, SATISFACTION GUARANTEED!
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
The first edition of this book sold more than 100,000 copies—and this new edition will show you why! Schaum’s Outline of Discrete Mathematics shows you step by step how to solve the kind of problems you’re going to find on your exams. And this new edition features all the latest applications of discrete mathematics to computer science! This guide can be used as a supplement, to reinforce and strengthen the work you do with your class text. (It works well with virtually any discrete mathematics textbook.) But it is so comprehensive that it can even be used alone as a text in discrete mathematics or as independent study tool!
|
| Customer Reviews: Read 3 more reviews...
 Excellent companion to your university textbook. October 22, 1999
Erik Gfesser (Lombard, IL United States)
37 out of 39 found this review helpful
Did you get stuck with a textbook (like Richard Johnsonbaugh's Discrete Mathematics - Fourth Edition) for your university Computer Science/ Discrete Mathematics course that just doesn't explain the concepts you're trying to learn? I definitely encourage you to purchase this book. However, along with this book you should also buy "2000 Solved Problems in Discrete Mathematics" in Schaum's Solved Problems Series. While the book I'm reviewing here has some problems and solutions, this additional book provides many variations of these problems, allowing you to look at problems from the different angles that will probably show up on your next exam.
Excellent study guide for students of discrete math and computer science March 21, 2006
calvinnme (Fredericksburg, Va)
8 out of 8 found this review helpful
Discrete mathematics, or the study of finite systems, has become increasingly important for students of computer science, and this book is a good foundational text on the subject. This Schaum's outline is much more complete than the average Schaum's, and it is also very clear and instructive. It is not just a good text for discrete mathematics. It also covers the basics of abstract algebra and the basics of the theory of computation.
The first 3 chapters cover sets, relations, functions, and algorithms, including a very good section on the complexity of algorithms. Chapter 4 is on logic and propositional calculus, which is the foundation of artificial intelligence and digital logic. The next three chapters cover the basics of vectors, matrices, counting (permutations and combinations), and probability theory. This material is important in the design and analysis of operating systems. Next are chapters on graph theory, directed graphs, and binary trees, all of which should be covered in any good course on the analysis of algorithms. These chapters include discussions of planarity, traversibility, minimal paths, and Warshall's and Huffman's algorithms. There is a chapter on languages and machines that includes material on regular expressions, automata, Turing machines, and computable functions. There is also a chapter dedicated to the very basics of abstract algebra, and another chapter on boolean algebra.
This text is therefore a superset of what you will probably find in an upper level undergraduate class in discrete mathematics, and is definitely a book you want to keep around especially if you are a computer science student and need additional study material for your core courses of artificial intelligence, analysis of algorithms, operating systems, and theory of computation. Highly recommended.
When some ppl make the already abstract more confusing ... June 20, 2005
mxpayn65 (Virginia Beach, VA)
4 out of 5 found this review helpful
This book can pull you out of confusion. After all, an abstract course in discrete structures which is supposed to be the fundamentals of learning computer hardware and software programming need not be made even more confusing. Grab this book and make learning discrete structures more enjoyable and less painful !
Overall, a good study aid January 7, 2001
Jonathan D. Decarlo (Thomaston, Connecticut USA)
3 out of 8 found this review helpful
This study guide goes over all the topics you would expect it to and explains them more clearly than most texts can. I recommend this to all who plan to take a course in Discrete Mathematics.
Very instructive September 8, 2005
Calculus cool (Chicago)
1 out of 4 found this review helpful
This math book simply helps and supports learning with good, specific examples and no jargon.
|
|
|
