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 |
Browsing Alfaisal University Shelves , Shelving location: On Shelf Close shelf browser
QA76.9.L63 M34 2019 How to speak machine : laws of design for a digital age / | QA76.9.M35 H867 2012 Essentials of discrete mathematics / | QA76.9.M35 K46 2012 Lectures on discrete mathematics for computer science / | QA76.9.M35 L485 2019 Essential discrete mathematics for computer science / | QA76.9 .M45 K65 2018 Pro .net memory management / | QA76.9 .N38 2024 Quick start guide to large language models : strategies and best practices for using ChatGPT and other LLMs / | QA76.9.N38 E46 2019 Introduction to natural language processing / |
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.--