Essential discrete mathematics for computer science / Harry Lewis and Rachel Zax.
By: Lewis, Harry R [author.].
Contributor(s): Zax, Rachel [author.].
Publisher: Princeton, New Jersey : Princeton University Press, ©2019Description: 388 p: illustrations ; 27 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 9780691179292; 0691179298.Subject(s): Computer science -- Mathematics | Computer science -- Mathematics | Diskrete Mathematik | InformatikGenre/Form: Print books.Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|
On Shelf | QA76.9.M35 L485 2019 (Browse shelf) | Available | AU00000000016333 |
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.
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.--