TY  - BOOK
AU  - Lewis,Harry R.
AU  - Zax,Rachel
TI  - Essential discrete mathematics for computer science
SN  - 9780691179292
AV  - QA76.9.M35 L485 2019
U1  - 004.0151 LE.E 2019 23
PY  - 2019///
CY  - Princeton and Oxford
PB  - Princeton University Press
KW  - Computer science
KW  - Mathematics
KW  - Diskrete Mathematik
KW  - Informatik
N1  - Includes bibliographical references and index; 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
N2  - 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.--
ER  -