Schaum's Outline of Discrete Mathematics (Schaum's) [Paperback]

Seymor Lipschutz (Author), Marc Lipson (Author)

Book Description

ISBN-10: 0070380457 | ISBN-13: 978-0070380455 | Publication Date: June 1, 1997 | Edition: 2

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!

Editorial Reviews

From the Back Cover

Master discrete mathematics and ace your exams with this easy-to-use guide that reinforces problem-solving skills and reduces your study time! Students of discrete mathematics love Schaum's­­--the first edition of this book was a major bestseller--­­and this edition will show you why!

Schaum's Outline of Discrete Mathematics lets you focus on the problems that are at the heart of the subject. It cuts your study time by eliminating the extraneous material that clutters up so many textbooks.

As you study at your own pace, this guide shows you step by step how to solve the kind of problems you're going to find on your exams. It gives you hundreds of completely worked problems with full solutions. Hundreds of additional problems let you test your skills, then check the answers. And this edition features all the latest applications of discrete mathematics to computer science!

So if you want to get a firm handle on discrete mathematics­­--whether to ace your course or to build a solid basis for future work or study--­­there's no better tool than Schaum's. Schaum's is the premier college course outline-­­the one that's been trusted by generations of students--­­the one that's sold more than 30 million copies! 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 be used alone as a text in discrete mathematics or as an independent study tool!

Chapters include:

• Set Theory
• Relations, Functions, and Algorithms
• Vectors and Matrices
• Counting Graph Theory
• Probability Theory
• Directed Graphs
• Algebraic Systems
• Ordered Sets
• Logic and Propositional Calculus
• Boolean Algebra
• Binary Trees
• Languages, Grammars, and Machines
• Properties of the Integers

About the Author

Seymour Lipschutz is on the faculty of Temple University and formerly taught at the Polytechnic Institute of Brooklyn College. He received his Ph.D. in 1960 at Courant Institute of Mathematical Sciences of New York University. He is one of Schaum's most prolific authors, and has also written Programming with Fortran; Probability; Finite Mathematics, Second Edition; Linear Algebra, Second Edition; Beginning Linear Algebra; Set Theory; and Essential Computer Mathematics.

Marc Lipson is on the faculty of the University of Georgia and formerly taught at Northeastern University and Boston University. He received his Ph.D. in finance in 1994 from the University of Michigan. He is also the coauthor of 3,000 Solved Problems in Discrete Mathematics with Seymour Lipschutz.

Product Details

• Paperback: 528 pages
• Publisher: McGraw-Hill; 2 edition (June 1, 1997)
• Language: English
• ISBN-10: 0070380457
• ISBN-13: 978-0070380455
• Product Dimensions: 10.8 x 8.2 x 1 inches
• Shipping Weight: 2.2 pounds
• Average Customer Review: 4.1 out of 5 stars  See all reviews (15 customer reviews)
• Amazon Best Sellers Rank: #364,366 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

43 of 46 people found the following review helpful:

5.0 out of 5 stars Excellent companion to your university textbook., October 22, 1999

By 

Erik Gfesser (Lombard, IL United States) - See all my reviews
(VINE VOICE)    (REAL NAME)   

Amazon Verified Purchase

This review is from: Schaum's Outline of Discrete Mathematics (Schaum's) (Paperback)

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.

12 of 12 people found the following review helpful:

5.0 out of 5 stars Excellent study guide for students of discrete math and computer science, March 20, 2006

By 

calvinnme - See all my reviews
(HALL OF FAME REVIEWER)    (VINE VOICE)    (TOP 50 REVIEWER)   

This review is from: Schaum's Outline of Discrete Mathematics (Schaum's) (Paperback)

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.

21 of 25 people found the following review helpful:

2.0 out of 5 stars Too Simple, March 22, 2002

By 

Matt Greer - See all my reviews

This review is from: Schaum's Outline of Discrete Mathematics (Schaum's) (Paperback)

I bought this book to help me survive my Discrete Math class, and ended up thoroughly disappointed. It's just too simple to be of any use. The examples it goes over are the obvious ones I've never had any trouble with, but more involved problems or complex proofs are nowhere to be found in the text. In the end I ended up relying on my course text much more than this, and I already had that book to begin with.