Essential discrete mathematics for computer science /
General Material Designation
[Book]
First Statement of Responsibility
Harry Lewis and Rachel Zax.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Princeton, New Jersey :
Name of Publisher, Distributor, etc.
Princeton University Press,
Date of Publication, Distribution, etc.
[2019]
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
xii, 388 pages :
Other Physical Details
illustrations ;
Dimensions
27 cm
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references and index.
CONTENTS NOTE
Text of Note
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.
0
SUMMARY OR ABSTRACT
Text of Note
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.