Amazon cover image
Image from Amazon.com

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

By: Contributor(s): Material type: TextTextPublisher: Princeton and Oxford : Princeton University Press, 2019Description: xii, 388 pages : illustrations ; 27 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9780691179292
  • 0691179298
Subject(s): DDC classification:
  • 004.0151 LE.E 2019 23
LOC classification:
  • QA76.9.M35 L485 2019
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.-- Source other than the Library of Congress.
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 Status Date due Barcode
Books Books The Knowledge Hub Library Computing 004.0151 LE.E 2019 (Browse shelf(Opens below)) Available 190283

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.-- Source other than the Library of Congress.

There are no comments on this title.

to post a comment.