Schaum's Outline of Discrete Mathematics, Revised Third EditionTough Test Questions? 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:
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. |
Contents
| 1 | |
| 23 | |
Chapter 3 Functions and Algorithms | 43 |
Chapter 4 Logic and Propositional Calculus | 70 |
Chapter 5 Techniques of Counting | 88 |
Chapter 6 Advanced Counting Techniques Recursion | 107 |
Chapter 7 Probability | 123 |
Chapter 8 Graph Theory | 154 |
Chapter 11 Properties of the Integers | 264 |
Chapter 12 Languages Automata Grammars | 303 |
Chapter 13 Finite State Machines and Turing Machines | 323 |
Chapter 14 Ordered Sets and Lattices | 337 |
Chapter 15 Boolean Algebra | 368 |
Vectors and Matrices | 409 |
Algebraic Systems | 432 |
Index | 467 |
Common terms and phrases
Accordingly adjacency list adjacency matrix algorithm appears in Fig belong binary tree Boolean algebra Boolean expression called circuit complement complete sum-of-products congruence equation connected Consider consists contains defined delete denoted directed graph divides divisors edges EXAMPLE exists Find the number finite fundamental product G in Fig gcd(a graph G Hamiltonian circuit hence homomorphism identity element Inclusion-Exclusion Principle input integers integral domain inverse isomorphic Karnaugh map lattice Let G linear linearly ordered mathematical induction maximal element minimal modulo multiplication node nonempty nonzero obtain one-to-one operation ordered set output partial order partition permutations polynomial positive integers prime implicants proposition Prove Theorem proved in Problem real numbers recurrence relation semigroup sequence Show simple path subgroup subset subtree sum-of-products sum-of-products form Suppose symbol traversal true truth table Turing machine unique solution vertex vertices words xyzt