Essential discrete mathematics for computer science
Lewis, Harry R.
Essential discrete mathematics for computer science - Princeton Princeton University Press 2019 - xii, 388 p. ill. 26 cm
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.
9780691179292
Computer science
Mathematics
Bayes'theorem
DAG (directed acyclic graph)
Euclid's algorithm
Inclusion -Exclusion Principle
Karatsuba's algorithm
Menger's theorem
Simpson's paradox
Crypography
004.0151 / LEW
Essential discrete mathematics for computer science - Princeton Princeton University Press 2019 - xii, 388 p. ill. 26 cm
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.
9780691179292
Computer science
Mathematics
Bayes'theorem
DAG (directed acyclic graph)
Euclid's algorithm
Inclusion -Exclusion Principle
Karatsuba's algorithm
Menger's theorem
Simpson's paradox
Crypography
004.0151 / LEW