Synopses & Reviews
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.
Synopsis
Covering basic topics in algebra, logic and combinatorics, this second edition of the text also shows the mathematical applications to various areas of computer science.
Synopsis
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!
Synopsis
Discrete mathematics becomes more and more important as the digital age goes forward. This newly revised third edition updates all areas of the subject.
About the Author
Seymour Lipschutz is a professor of mathematics at TempleUniversity. He has written 15 Schaum's Outlines.
Mark Lipson is on the mathematics faculty at the University of Georgia.
Table of Contents
Chapter 1. Set Theory
Chapter 2. Relations
Chapter 3. Functions and Algorithms
Chapter 4. Logic and Propositional Calculus
Chapter 5. Techniques of Counting
Chapter 6. Advanced Counting Techniques, Recursion
Chapter 7. Probability
Chapter 8. Graph Theory
Chapter 9. Directed Graphs
Chapter 10. Binary Trees
Chapter 11. Properties of the Integers
Chapter 12. Languages, Automata, Grammars
Chapter 13. Finite State Machines and Turing Machines
Chapter 14. Ordered Sets and Lattices
Chapter 15. Boolean Algebra
Appendix A: Vectors and Matrices
Appendix B: Algebraic Systems
Index