Product Description
Confusing Textbooks? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you:

• Practice problems with full explanations that reinforce knowledge
• Coverage of the most up-to-date developments in your course field
• In-depth review of practices and applications

Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores!

Schaum's Outlines-Problem Solved. ... Read more

Customer Reviews (10)

Incomplete
This book does not cover college level discrete math well enough. Recursion and induction are given only a cursory paragraph. Proofs are not adequately covered.

Good Book
This book is a good exercise book. It has tons of solved and review problems most of which are proofs of the theories explained through the chapters. Despite that, I do not see the book adequate for an undergraduate course by itself. It as of great use in tutorials and as a supporting reading.

Excellentstudy guide for students of discrete math and computer science
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.

Typical Schaum's
This is a very helpful outline whether you are taking the class and need a supplement or are just trying to learn the material on your own.The writing is clear and succinct, and there are hundreds and hundreds of practice problems all of which are answered.The topics covered are standard for the topic, so this book will cover everything in your class unless your teacher has some unorthodox lesson plan.My one caveat is that there are occasional errors in the answer keys.This can be frustrating especially if you don't feel confident in your own work.The errors are far and few between for the most part and if you can live with them then you will get much use out of this book.Highly recommended.

Very instructive
This math book simply helps and supports learning with good, specific examples and no jargon. ... Read more

Product Description
Discrete Mathematics and its Applications, Sixth Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering.This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide a wide variety of real-world applications…from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields. ... Read more

Customer Reviews (33)

Alright
This book is ok it has some decent examples but not too good. I would recommend a good teacher to actually understand this stuff. It can be hard to learn just by reading the book

I good book
Amazon generally has really good costs especially when compared to school bookstores.I ended up paying around $80 less for this book on Amazon than from the book store on campus.Considering that is the current edition of the book and that it is the number one used Discrete Mathematics book in the country a great deal for an excellent book!

Product As Advertised
The product came quickly and was in the same shape it was described to me as.No complaints.

This book in not for first year undergraduates...
This book is excellent... It only needs you to have some math proficiency. For example, if you already have taken at least two three math courses in calculus and similar (engineering curricula) this book should not be a problem for you. The application area mentioned within the book is mainly in computer science. But, as every math book I read, it needs you to be patient and spend some time thinking and trying to solve problems your self. This book can be read by undergraduates (in engineering) in their upper years of study.

Outstanding
This book came to me in absolutely perfect condition, even though it was posted as used.The time received was excellent as well-perfect experience!Thanks! ... Read more

Product Description
Random projection is a simple geometric technique for reducing the dimensionality of a set of points in Euclidean space while preserving pairwise distances approximately. The technique plays a key role in several breakthrough developments in the field of algorithms. In other cases, it provides elegant alternative proofs. The book begins with an elementary description of the technique and its basic properties. Then it develops the method in the context of applications, which are divided into three groups. The first group consists of combinatorial optimization problems such as maxcut, graph coloring, minimum multicut, graph bandwidth and VLSI layout. Presented in this context is the theory of Euclidean embeddings of graphs. The next group is machine learning problems, specifically, learning intersections of halfspaces and learning large margin hypotheses. The projection method is further refined for the latter application. The last set consists of problems inspired by information retrieval, namely, nearest neighbor search, geometric clustering and efficient low-rank approximation. Motivated by the first two applications, an extension of random projection to the hypercube is developed here. Throughout the book, random projection is used as a way to understand, simplify and connect progress on these important and seemingly unrelated problems. The book is suitable for graduate students and research mathematicians interested in computational geometry. ... Read more

Product Description
Here, the authors strive to change the way logic and discrete math are taught in computer science and mathematics: while many books treat logic simply as another topic of study, this one is unique in its willingness to go one step further. The book traets logic as a basic tool which may be applied in essentially every other area. ... Read more

Customer Reviews (16)

A1 BOOK FOR LOGICAL STUDIES!
I STUDY COMPUTING ENG. THIS BOOK HAS BEEN VERY USEFUL IN ALL MY LOGICAL AND ALGORITHMICAL SUBJECTS.

THIS BOOK CAN BE CONSIDERED THE EIGHT WORLD MARVEL!

A must have
This book is simply the best compendium of the mathematical basis of computer science

Great book
I took a math class with Rodrigo Cardozo, based on this book and it really taught me how to use propositional calculus while applying it to computer programming.
It has only a few examples on how to prove the theorems for each chapter, yet if you take the time to develop a proof for each theorem yourself -as I have done-, you will end up with a very solid knowledge of logic and a structured idea of how to approach math and use it to write perfect programs from the start.
It is a challenging task. I enjoyed it.

5 Stars, of course!
We have used this book as a text for discrete math courses in our undergraduate Computing Engineering and Systems program (University of los Andes, Colombia). There are a lot of advantages using this approach instead of the classical one (e.g., people really learn to prove and learn to write correct proofs).

However, to grasp these ideas you have to be patient and open minded. When other reviewers give 1 star to the book it is clear for me that perhaps they were expecting something magical that did not occur. This presentation of logic and its applications to informatics provides an excellent way to learn and really use the knowledge in the praxis.

In Chapter 8 you go seamlessly from propositional to higher order logic. Sums and logical quantifications are, for example, treated in an uniform way. Maybe the type concept is not so fine explained, but one has to remember that this is an introductory book.

5 stars, of course.

Not for independent study, questionable otherwise
For the right kind of reader - namely, one with a competent instructor - this book probably does a lot of things well.It starts off by requiring you to get a firm grip on concepts that are used throughout the remainder of the book; you'll be doing proofs right off the bat.Unfortunately, I couldn't understand the content of the first four chapters until after a month of study.

I was genuinely applying myself, but I just had a difficult time understanding this material.You may struggle unless you've previously had an introduction to proofs of this kind, like in an Abstract Math course.The proofs from high school Geometry class are nothing like those seen here!

I can only recommend this book if a really good instructor comes with it.If you know you'll have a good professor who can explain things well, I think this book can take you into some tougher, more complex tasks relatively quickly.If not, you're going to have a devil of a time penetrating this thing: the author's words seem to trip over themselves all the time.It's somewhat of a difficult read, at least at the beginning; once I got my bearings, the later chapters seemed to get a little easier.

If only these concepts could be taught better... but I can't see a better method than what's done here, and that method is initially horribly difficult.

I do not recommend this book for independent study, but it may work when paired with a knowledgeable, helpful instructor.The fact that there are no answers in the back of the book limit the book's use. ... Read more

Product Description
An essential subject for students in mathematics,computer science, and engineering.Covers logic, set theory, vectors,graph theory, probability, statistics, Boolean algebra, linearprogramming, and theory of games.Problem-solving strategies areincluded at the beginning of every chapter for each topic. ... Read more

Customer Reviews (1)

Great supplement or stand-alone book for discrete!
I bought this book about 8 weeks before I needed to start my CS 250 class, which is basically Discrete Mathematics. Paired with "Discrete Mathematics with Applications 3rd Edition by Epp, I did fantastic in the class, receiving an A+. Would recommend this book to anyone. It starts with very small equations, and works it's way up, unlike many math books which just dive into the meat and potatoes. Great for someone who likes to learn the hows and whys. As a result of this book's success, I purchased REA's Calculus and Chemistry as well, and my Dept. Dean purchased copies of this book for the tutoring center. Definitely a great buy for the money. ... Read more

Product Description

Product Description
This book introduces readers to the mathematics of computer science and prepares them for the math they will encounter in other college courses. It includes applications that are specific to computer science, helps learners to develop reasoning skills, and provides the fundamental mathematics necessary for computer scientists.Chapter topics include sets, functions and relations, Boolean algebra, natural numbers and induction, number theory, recursion, solving recurrences, counting, matrices, and graphs.For computer scientists and the enhancement of programming skills. ... Read more

Customer Reviews (1)

This book sucks
If you are a math professor, considering using this book for a discrete math class, please, spare your students the misery and the money. My professor, with good intentions, assigned this book because it is cheeper than a traditional text book (still extremely expensive considering the book is very short and does not go into detail.)Most students in the class ended up buying an additional discrete mathematics textbook to supplement this one because this book did not explain most of the concepts in enough detail. I am studying for a test right now and the book is not helping me at all, especially since for a comprehensive discrete math course, my professor had to include in his lecture a lot of content not mentioned in this book.
Also, there was no CS prerequirement for this course, so the content of this book that deals with computer programing is off limits for the class and irrelevent and impossible to understand for me, a student with no background in computer science.
I would have prefered to spend the additional 40-60$ of the bat for a comprehensive well written discrete mathematics book, rather than waste $40-$50 on this one and have to spend $100 on another textbook to supplement the content. ... Read more

Product Description
This is a 404 page collection of practice problems with fully worked out solutions. ... Read more

Customer Reviews (1)

Superb and concise summary of discrete mathematics
I was looking for a book to review discrete mathematics that I had taken 8 years ago using the obtuse Rosen book (Discrete Mathematics and Its Applications). I ordered another book on discrete math and the bookstore sent me both my ordered book and this workbook (I guess to get rid of it). Wow. This book offers a fantastic summary of discrete math, has good sample problems, and has tons of problems for the student to work out (along with answers to all the problems at the end of the workbook). The actual book I ordered is ok. This one, however, is definitely a hidden gem. ... Read more

Product Description
For one-semester undergraduate Discrete Mathematics courses for math and computer science majors.This exceedingly well-written text equips students to apply discrete mathematics and provides opportunities for practice of the concepts presented. A semester of Calculus is useful for reasons of sophistication. ... Read more

Customer Reviews (3)

Great Book
This was the required textbook for a discrete math course that I took and I think it's a great book. The material we covered was thorough and rigorous but also straightforward to learn.

Good book
This product came to me in tack and in good condition. It was well worth the price!

Adequate, but with one amazing and serious flaw
There were two things in this book that I found distinctive, one positive and the other negative. In the positive area, the material at the end of the chapters is more thorough than I have seen in any other discrete mathematics book. Chapter reviews are composed of:

*) A summary of the chapter.
*) The notation used in the chapter.
*) A list of the definitions of the new terms used in the chapter.
*) A list of the theorems in the chapter.
*) A sample exam over the chapter.
*) Two lists of projects, one mathematical and the other using computer science.
*) Solutions to the questions in the sample exam.

Quick check problems are scattered throughout the chapter and the solutions to those problems immediately precede the chapter summary material.
On the negative side, the title of the twelfth and last chapter is "Functions, Relations, Databases and Circuits." It baffles me when I see relations and functions relegated to the last chapter. Although relations and functions are not explicitly defined before chapter twelve, they are used throughout the book. Standard functional notation is used throughout chapter four, "Algorithms", and chapter seven, "Recursion." Section 7.2 is "Recurrence Relations" and section 7.4 is "Generating Functions." In my opinion, delaying the definition of a function to page 729 and that of a relation to page 732 is very wrong. If I were to use this book, I would be forced to cover the material at the start of chapter 12 immediately after chapter two, "Set, Logic and Boolean Algebras." Since I would not do that, I will not use this book as a text.
Other than these two features, the coverage is that usually found in a discrete math book. As the title suggests, there is more emphasis on proof than there is in other books, although the extra amount is not that significant. While some proofs are presented in discrete mathematics, it is generally the first course, so the amount of proofs that the students are required to do is less than that in more advanced math courses. Therefore, the presence of more proofs will not sway me towards adopting the book. ... Read more

Customer Reviews (37)

Discreet?
First I must say;I HATE DISCREET MATH, but with this book, I was able to muddle through even though the professor never even used one page from it after he recommended buying it.

a good introductory college level text book
I got this book to supplement the course book required for my class. This one has about as much text, but covers fewer things. It is very clear and precise, with lots of examples.

Utterly Pointless
This book doesnt seem to have any head or tail. Half the time I wonder what exactly Im supposed to do, and WHY I should be doing it. The author does not properly impress upon the reader the reasons why each subtopic might be important, so you come away with the idea that "well, we're doing it this way because some mathematician did it this way in the past".

Unfortunately, I suspect this is the case with most, if not all books dealing with discrete math.

(Note: This is from a Computer Science Major, maybe math majors have a different view).

This is when I fell in love with Math.
This book is well written, it contains good examples, and excellent exposition. This was my introduction to mathematical proofs, and after studying it well, I was able to approach more advanced courses, such as advanced calculus and modern algebra with a clear view of how to approach problems where a mathematical proof is needed. I highly recommend this book to undergraduate math majors.

Nice and Clear
I honestly can't see how you'd make a book explaining such topics as prime numbers and set theory any clearer than this one.I consider this to be a high quality book.It's easy to understand and reference.Its one drawback is that it covers only a limited number of topics, and none of them are heavy duty.If I found a book that explained graduate level math as well as this one explains undergraduate math, I'd consider it to be gold. ... Read more

Product Description
Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis.

The theory of discrete convex analysis has attracted the interest of many researchers in the field of optimization. Discrete Convex Analysis provides the information that professionals in optimization will need to "catch up" with this new theoretical development. It also presents an unexpected connection between matroid theory and mathematical economics and expounds a deeper connection between matrices and matroids than most standard textbooks. Professionals in areas other than optimization will enjoy applying these new mathematical techniques and ideas to their own problems. ... Read more

Product Description
Provides preparation for the new AQA specification B. The text provides; clear explanations of key topics; worked examples with examiners' tips; graded exercises guiding the pupil from basic to examination level; and self-assessment tests. ... Read more

Product Description
Intended for a one- or two-term discrete math introductory course, Introduction to Discrete Mathematics is designed to fulfill a general education requirement or a prerequisite for computer science courses. Written in an informal and conversational style, the mathematics is developed in a continuous progression from simple to complex. More sophisticated material is postponed until it is actually necessary. This new text also accomodates variations in student preparation and ability, as well as course design, by including special discussions called "Complements" and a number of challenging problems for more advanced and highly motivated students. ... Read more

Product Description
Provides preparation for the new AQA specification B. The text provides; clear explanations of key topics; worked examples with examiners' tips; graded exercises guiding the pupil from basic to examination level; and self-assessment tests. ... Read more

Product Description
This text is suitable for introduction to discrete mathematics course taken by students preparing for future coursework in areas such as maths, computer science and engineering.The strength of its approach is the balance of theory with relevant applications, as well as the overall nature of the topic coverage. ... Read more

Customer Reviews (95)

Discrete Math and Its Applications
This order was placed on 15 March 2010 with iegoldman and I still have not received the book.

Emails have been sent but no response!Supposedly the book has been shipped but should it take a month to get here.And why doesn't anyone respond to email requests for update, tracking, etc.

Very poor delivery service!

Good Word
Needed the book for class.Got it in a timely manner.Was in better condition than described.

Great help in a proofs class.
I had this book for a discrete math class about 10 years ago. I'm glad I held onto it. It's been great for a proofs class which uses a completely indecipherable text (A Transition to Advanced Mathematics). The text has answers for odd problems. The solution manual for the 4th Edition is still out there, I got a copy a month ago thru Amazon. The solutions are fully answered and mostly in English. A great combo if you're in a proofs/intro to higher math class.

Took 2 months just to ship
Took two months to ship.It was for a class.Dropped the class two weeks ago.Received the book two days ago!School started about a month ago.Constantly trying to get a hold of somone, generic emails twice.Finally talked to somone "should be there by now", "going to check the post office" never heard from them again.They don't even know the book arrived...

In chinese?
When I received my book, the front cover was half in chinese and there were excerpts throughout that were also in Chinese. I was very confused. However, the important stuff, like the actual text and the problems were in English. Bizarre. Whatever, it was cheap ... Read more

Product Description
In a comprehensive yet easy-to-follow manner, Discrete Mathematics for New Technology follows the progression from the basic mathematical concepts covered by the GCSE in the UK and by high-school algebra in the USA to the more sophisticated mathematical concepts examined in the latter stages of the book. The book punctuates the rigorous treatment of theory with frequent uses of pertinent examples and exercises, enabling readers to achieve a feel for the subject at hand. The exercise hints and solutions are provided at the end of the book. Topics covered include logic and the nature of mathematical proof, set theory, relations and functions, matrices and systems of linear equations, algebraic structures, Boolean algebras, and a thorough treatise on graph theory.

Although aimed primarily at computer science students, the structured development of the mathematics enables this text to be used by undergraduate mathematicians, scientists, and others who require an understanding of discrete mathematics. ... Read more

Customer Reviews (3)

Great even for Praxis Math test
I originally purchased this book because the topics list had a lot of common items with the Praxis test list (for high school math teachers). Although I recognize this is a class textbook somewhere I did not take it in a class and simply used it for self-study. I found it to be one of the best math textbooks I've ever used for self-study. Although probably very few people checking out these reviews will be taking the Math Praxis test (WEST-E in Washington state), if you are then I highly recommend this text to study/review.

The text covers a wide range of topics, and in that sense it truly is good for students considering technology or computer programming. It is also good in many parts for people who work with databases and are interested in learning more about the mathematics behind databases. It also has an interesting and reasonably well developed chapter on graph theory which can appeal to a wide range of fields - in some ways the introductory level approach to this field is perfect as it can easily be explored by people not wildly interested in mathematics and yet they can find find relevance in almost any field.

Topics covered include functions, set theory, graph theory and some basic combinatorics. This book provides a good foundation for each area, but understandably specializing in the mathematics of any particular field requires additional specialized texts.

One of the best specifics and strengths of the text is a multi-page multi-example review of injective/surjective/bijective functions. Usually these terms are described in a terse sentence or two each - this text gives pages of examples,pictures, etc.

This book is accessible to students whom have successfully completed a strong algebra/geometry sequence... precalculus will help but is not absolutely necessary.

Thank You...
...for cleaning up Johnsonbaugh's mess.I bought this as a supplemental text for a DM course using Johnsonbaugh's book.Thank god I bought this book!

It is a very good text book for college student
This book is clear,had a lot of very good examples and easy to understand. ... Read more

Product Description
2003 Impression ... Read more

Product Description
This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany, as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics.
The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra. ... Read more

Product Description
Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. This volume addresses the latest developments in this active field and represents the current thinking of many of the world's leading experts in this field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this book. ... Read more