Essential discrete mathematics for computer science / Harry Lewis and Rachel Zax.
| Author/creator | Lewis, Harry R. author. |
| Other author | Zax, Rachel, author. |
| Format | Book |
| Publication | Princeton, New Jersey : Princeton University Press, [2019] |
| Description | xii, 388 pages : illustrations ; 27 cm |
| Subjects |
| Contents | The pigeonhole principle -- Basic proof techniques -- Proof by mathematical induction -- Strong induction -- Sets -- Relations and functions -- Countable and uncountable sets -- Structural induction -- Propositional logic -- Normal forms -- Logic and computers -- Quantificational logic -- Directed graphs -- Digraphs and relations -- States and invariants -- Undirected graphs -- Connectivity -- Coloring -- Finite automata -- Regular languages -- Order notation -- Counting -- Counting subsets -- Series -- Recurrence relations -- Probability -- Bayes' theorem -- Random variables and expectation -- Modular arithmetic -- Public key cryptography. |
| Abstract | Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises. |
| Bibliography note | Includes bibliographical references and index. |
| ISBN | 9780691179292 hardcover |
| ISBN | 0691179298 hardcover |