FREE SHIPPING BOTH WAYS
ON EVERY ORDER!
LIST PRICE:
$67.71
Sorry, this item is currently unavailable.
Discrete Mathematics and Its Applications
ISBN: 9780070537446 | 0070537445
Edition: 2ndFormat: Hardcover
Publisher: McGraw-Hill Companies, The
Pub. Date: 2/1/1991
Why Rent from Knetbooks?
Because Knetbooks knows college students. Our rental program is designed to save you time and money. Whether you need a textbook for a semester, quarter or even a summer session, we have an option for you. Simply select a rental period, enter your information and your book will be on its way!
Top 5 reasons to order all your textbooks from Knetbooks:
- We have the lowest prices on thousands of popular textbooks
- Free shipping both ways on ALL orders
- Most orders ship within 48 hours
- Need your book longer than expected? Extending your rental is simple
- Our customer support team is always here to help
| Discrete Mathematics and Its Applications, Fifth Edition | |
| The Foundations: Logic and Proof, Sets, and Functions | |
| Logic | |
| Propositional Equivalences | |
| Predicates and Quantifiers | |
| Nested Quantifiers | |
| Methods of Proof | |
| Sets | |
| Set Operations | |
| Functions | |
| The Fundamentals: Algorithms, the Inte... MORE | |
| Algorithms | |
| The Growth of Functions | |
| Complexity of Algorithms | |
| The Integers and Division | |
| Applications of Number Theory | |
| Matrices | |
| Mathematical Reasoning, Induction, and Recursion | |
| Proof Strategy | |
| Sequences and Summations | |
| Mathematical Induction | |
| Recursive Definitions and Structural Induction | |
| Recursive Algorithms | |
| Program Correctness | |
| Counting | |
| The Basics of Counting | |
| The Pigeonhole Principle | |
| Permutations and Combinations | |
| Binomial Coefficients | |
| Generalized Permutations and Combinations | |
| Generating Permutations and Combinations | |
| Discrete Probability | |
| An Introduction to Discrete Probability | |
| Probability Theory | |
| Expected Value and Variance | |
| Advanced Counting Techniques | |
| Recurrence Relations | |
| Solving Recurrence Relations | |
| Divide-and-Conquer Algorithms and Recurrence Relations | |
| Generating Functions | |
| Inclusion-Exclusion | |
| Applications of Inclusion-Exclusion | |
| Relations | |
| Relations and Their Properties | |
| n-ary Relations and Their Applications | |
| Representing Relations | |
| Closures of Relations | |
| Equivalence Relations | |
| Partial Orderings | |
| Graphs | |
| Introduction to Graphs | |
| Graph Terminology | |
| Representing Graphs and Graph Isomorphism | |
| Connectivity | |
| Euler and Hamilton Paths | |
| Shortest-Path Problems | |
| Planar Graphs | |
| Graph Coloring | |
| Trees | |
| Introduction to Trees | |
| Applications of Trees | |
| Tree Traversal | |
| Spanning Trees | |
| Minimum Spanning Trees | |
| Boolean Algebra | |
| Boolean Functions | |
| Representing Boolean Functions | |
| Logic Gates | |
| Minimization of Circuits | |
| Modeling Computation | |
| Languages and Grammars | |
| Finite-State Machines with Output | |
| Finite-State Machines with No Output | |
| Language Recognition | |
| Turing Machines | |
| Appendixes | |
| Exponential and Logarithmic Functions | |
| Pseudocode | |
| Table of Contents provided by Publisher. All Rights Reserved. |
Related Products
Discrete Mathematics and Its A...
Please wait while this item is added to your cart...
