
Discrete Mathematics and Its Applications
by Rosen, Kenneth H.-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
Buy New
Rent Textbook
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
Table of Contents
PrefaceTo the Student1 The Foundations: Logic, Sets, and Functions1.1 Logic1.2 Propositional Equivalences1.3 Predicates and Quantifiers1.4 Sets1.5 Set Operations1.6 Functions1.7 Sequences and Summations1.8 The Growth Functions2 The Fundamentals: Algorithms, the Integers, and Matrices2.1 Algorithms2.2 Complexity of Algorithms2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
1 The Foundations: Logic, Sets, and Functions1.1 Logic1.2 Propositional Equivalences1.3 Predicates and Quantifiers1.4 Sets1.5 Set Operations1.6 Functions1.7 Sequences and Summations1.8 The Growth Functions2 The Fundamentals: Algorithms, the Integers, and Matrices2.1 Algorithms2.2 Complexity of Algorithms2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
1.2 Propositional Equivalences1.3 Predicates and Quantifiers1.4 Sets1.5 Set Operations1.6 Functions1.7 Sequences and Summations1.8 The Growth Functions2 The Fundamentals: Algorithms, the Integers, and Matrices2.1 Algorithms2.2 Complexity of Algorithms2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
1.4 Sets1.5 Set Operations1.6 Functions1.7 Sequences and Summations1.8 The Growth Functions2 The Fundamentals: Algorithms, the Integers, and Matrices2.1 Algorithms2.2 Complexity of Algorithms2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
1.6 Functions1.7 Sequences and Summations1.8 The Growth Functions2 The Fundamentals: Algorithms, the Integers, and Matrices2.1 Algorithms2.2 Complexity of Algorithms2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
1.8 The Growth Functions2 The Fundamentals: Algorithms, the Integers, and Matrices2.1 Algorithms2.2 Complexity of Algorithms2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
2.1 Algorithms2.2 Complexity of Algorithms2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
2.3 The Integers and Division2.4 Integers and Algorithms2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
2.5 Applications of Number Theory2.6 Matrice3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
3 Mathematical Reasoning3.1 Methods of Proof3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
3.2 Mathematical Induction3.3 Recursive Definitions3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
3.4 Recursive Algorithms3.5 Program Correctness4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
4 Counting4.1 The Basics of Counting4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
4.2 The Pigeonhole Principle4.3 Permutations and Combinations4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
4.4 Discrete Probability4.5 Probability Theory4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
4.6 Generalized Permutations and Combinations4.7 Generating Permutations and Combinations5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
5 Advanced Counting Techniques5.1 Recurrence Relations5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
5.2 Solving Recurrence Relations5.3 Divide-and-Conquer Relations5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
5.4 Generating Functions5.5 Inclusion-Exclusion5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
5.6 Applications of Inclusion-Exclusion6 Relations6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
6.1 Relations and Their Properties6.2 n-ary Relations and Their Applications6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
6.3 Representing Relations6.4 Closures of Relations6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
6.5 Equivalence Relations6.6 Partial Orderings7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
7 Graphs7.1 Introduction to Graphs7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
7.2 Graph Terminology7.3 Representing Graphs and Graph Isomorphism7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
7.4 Connectivity7.5 Euler and Hamilton Paths7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
7.6 Shortest Path Problems7.7 Planar Graphs7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
7.8 Graph Coloring8 Trees8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
8.1 Introduction to Trees8.2 Applications of Trees8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
8.3 Tree Traversal8.4 Trees and Sorting8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
8.5 Spanning Trees8.6 Minimum Spanning Trees9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
9 Boolean Algebra9.1 Boolean Functions9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
9.2 Representing Boolean Functions9.3 Logic Gates9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
9.4 Minimization of Circuits10 Modeling Computation10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
10.1 Languages and Grammar10.2 Finite-State Machines with Output10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
10.3 Finite-State Machines with no Output10.4 Language Recognition10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
10.5 Turing MachinesAppendixes AA.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
A.1 Exponential and Logarithmic FunctionsA.2 PseudocodeSuggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
Suggested ReadingsSolutions to Odd-Numbered ExercisesIndex of BiographiesIndex
Index of BiographiesIndex
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.