This highly regarded work fills the need for a treatment of elementary discrete mathematics that provides a core of mathematical terminology and concepts as well as emphasizes computer applications. Includes numerous elementary applications to computing and examples with solutions. Title of related interest by Waveland Buckley-Lewinter, Introductory Graph Theory with Applications (ISBN 9781478611752). 1. Number Systems The Binary System / The Octal and Haxadecimal Systems / The Integers / The Real Numbers / Case Computer Binary Numbers / Case Computer Floating-Point Numbers / Case Computer Floating-Point Arithmetic / Case Memory Addressing and Data Encoding 2. Sets and Logic Sets and Elements / Subsets / Venn Diagrams / Intersections, Unions, and Complements / Conjunction, Disjunction, and Negation / Conditional and Biconditional Statements / Tautologies and Contradictions / Logical Implication and Decision Tables / Case Searching and Sorting 3. Combinatorics Mathematical Induction / Permutations / Combinations / Binomial Coefficients / Distributions / Case Correctness of Algorithms / Case Introduction to Algorithm Analysis 4. Probability Finite Probability / Conditional Probability and Independence / Compound Experiments and Repeated Trials / Random Variables and Expected Value / Case Random Numbers and Simulation 5. Relations and Functions Relations / Functions / Graphs of Functions / Three Classes of Functions / Operations on Inverses / Case Computer Functions / Case Algorithm Orders of Magnitude / Case Cryptography 6. Vectors and Matrices Matrices and Arrays / Matrix Multiplication / The Inverse of a Matrix and Determinants / Case Stacks, Queues, and Deques / Case Implementation and Comparison of Sorting Algorithms 7. Boolean Algebra Boolean Algebras and Their Properties / Boolean Functions / Karnaugh Maps and Prime Implicants / Minimizing Boolean Functions and Expressions / Case Switching Theory 8. Graph Theory Graphs and Digraphs / Basic Definitions / Classes of Graphs / Matrices Associated with Graphs / Connectivity / Traversing Graphs / Case Heap Sort / Case The Critical Path Method