Normal view MARC view ISBD view

Essential discrete mathematics for computer science

By: Lewis, Harry R.
Contributor(s): Zax, Rachel.
Material type: materialTypeLabelBookPublisher: Princeton Princeton University Press 2019Description: xii, 388 p. ill. 26 cm.ISBN: 9780691179292.Subject(s): Computer science | Mathematics | Bayes'theorem | DAG (directed acyclic graph) | Euclid's algorithm | Inclusion -Exclusion Principle | Karatsuba's algorithm | Menger's theorem | Simpson's paradox | CrypographyDDC classification: 004.0151 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.
Item type Current location Call number Status Date due Barcode
Books 004.0151 LEW (Browse shelf) Available 032470
Books 004.0151 LEW (Browse shelf) Available 031959

Includes bibliographical references and index.

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.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha