Dr. S. R. Lasker Library Online Catalogue

Home      Library Home      Institutional Repository      E-Resources      MyAthens      EWU Home

Amazon cover image
Image from Amazon.com

Essential discrete mathematics for computer science / Harry Lewis and Rachel Zax.

By: Lewis, Harry RContributor(s): Zax, RachelMaterial type: TextTextLanguage: English Publication details: Princeton : Princeton University Press, 2019. Description: xii, 388 p. : ill. ; 26 cmISBN: 9780691179292; 0691179298Subject(s): Computer science -- Mathematics | Computer science -- MathematicsDDC classification: 004.0151 Online resources: WorldCat Details
Contents:
Table of 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.
Summary: 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.--
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Copy number Status Date due Barcode Item holds
Text Text Dr. S. R. Lasker Library, EWU
Reserve Section 		Non-fiction 004.0151 LEE 2019 (Browse shelf(Opens below)) C-1 Not For Loan 31651
Text Text Dr. S. R. Lasker Library, EWU
Circulation Section 		Non-fiction 004.0151 LEE 2019 (Browse shelf(Opens below)) C-2 Available 31652
Total holds: 0

Includes bibliographical references and index.

Table of 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.

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.--

Computer Science & Engineering Computer Science & Engineering

Sagar Shahanawaz

There are no comments on this title.

to post a comment.