A First Course in Discrete Mathematics

A First Course in Discrete Mathematics

• Used Book in Good Condition

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.<p> Title of related interest by Waveland Press: Buckley-Lewinter, <i>Introductory Graph Theory with Applications</i> (ISBN 9781478611752).<p> 1. Number Systems<p> The Binary System / The Octal and Haxadecimal Systems / The Integers / The Real Numbers / Case Study: Computer Arithmetic: Binary Numbers / Case Study: Computer Arithmetic: Floating-Point Numbers / Case Study: Computer Arithmetic: Floating-Point Arithmetic / Case Study: Memory Addressing and Data Encoding<p> 2. Sets and Logic<p> 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 Study: Searching and Sorting<p> 3. Combinatorics<p> Mathematical Induction / Permutations / Combinations / Binomial Coefficients / Distributions / Case Study: Correctness of Algorithms / Case Study: Introduction to Algorithm Analysis<p> 4. Probability<p> Finite Probability / Conditional Probability and Independence / Compound Experiments and Repeated Trials / Random Variables and Expected Value / Case Study: Random Numbers and Simulation<p> 5. Relations and Functions<p> Relations / Functions / Graphs of Functions / Three Classes of Functions / Operations on Functions: Inverses / Case Study: Computer Functions / Case Study: Algorithm Analysis: Orders of Magnitude / Case Study: Cryptography<p> 6. Vectors and Matrices<p> Matrices and Arrays / Matrix Multiplication / The Inverse of a Matrix and Determinants / Case Study: Stacks, Queues, and Deques / Case Study: Implementation and Comparison of Sorting Algorithms<p> 7. Boolean Algebra<p> Boolean Algebras and Their Properties / Boolean Functions / Karnaugh Maps and Prime Implicants / Minimizing Boolean Functions and Expressions / Case Study: Switching Theory<p> 8. Graph Theory<p> Graphs and Digraphs / Basic Definitions / Classes of Graphs / Matrices Associated with Graphs / Connectivity / Traversing Graphs / Case Study: Heap Sort / Case Study: The Critical Path Method