Essential Discrete Mathematics for Computer Science (eBook)

Harry Lewis, Rachel Zax (Autoren)

eBook Download: PDF

2019
Princeton University Press (Verlag)
978-0-691-19061-7 (ISBN)

Infos

A more intuitive approach to the mathematical foundation of computer scienceDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn. Guiding students quickly through thirty-one short chapters that discuss one major topic each, this flexible book can be tailored to fit the syllabi for a variety of courses.Proven in the classroom, 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. The text requires only precalculus, and where calculus is needed, a quick summary of the basic facts is provided.Essential Discrete Mathematics for Computer Science is the ideal introductory textbook for standard undergraduate courses, and is also suitable for high school courses, distance education for adult learners, and self-study.The essential introduction to discrete mathematicsFeatures thirty-one short chapters, each suitable for a single class lessonIncludes more than 300 exercisesAlmost every formula and theorem proved in fullBreadth of content makes the book adaptable to a variety of coursesEach chapter includes a concise summaryCurated video supplements available to instructors and studentsSolutions manual available to instructors

Autor

Harry Lewis is Gordon McKay Professor of Computer Science and former dean of Harvard College at Harvard University. His books include Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion. Rachel Zax is a software engineer at Google.

Produkt-Details

• Erscheint lt. Verlag: 19.3.2019
• Zusatzinfo: 116 color + 77 b/w illus. 19 tables
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Mathematik / Informatik ► Mathematik
• Schlagworte: algorithm • analysis of algorithms • Applied mathematics • arithmetic • arithmetic logic unit • arithmetic mean • arithmetic progression • Best, worst and average case • Big O notation • bijection • Binary logarithm • Binary number • Binary Relation • Binary search algorithm • Computation • Computer Program • Computer Science • Computer Scientist • Concatenation (mathematics) • Connected component (graph theory) • Connectivity (graph theory) • Deterministic automaton • deterministic finite automaton • Diagram (category theory) • discrete logarithm • Discrete Mathematics • Disk (mathematics) • Element (mathematics) • Euler's Theorem • Expression (mathematics) • Fermat's Little Theorem • Foundations of mathematics • Function (mathematics) • fundamental theorem of arithmetic • graph coloring • Graph (discrete mathematics) • Gray code • Harmonic series (mathematics) • hash function • Inequality (mathematics) • Instance (computer science) • Integer • Kruskal's Algorithm • linear algebra • Logical connective • Logical disjunction • machine learning • Master theorem • Mathematical fallacy • Mathematical Induction • Mathematical Logic • Mathematical Notation • Mathematical Proof • mathematical structure • mathematician • Mathematics • Menger's Theorem • modular arithmetic • Multiplicity (mathematics) • Natural number • Nondeterministic finite automaton • Number Theory • Numerical Integration • optimization problem • Parameter (computer programming) • Parity (mathematics) • Permutation • pigeonhole principle • Plaintext • polynomial • Predicate logic • Predicate (mathematical logic) • Prime number • Probability • Proportionality (mathematics) • Propositional Calculus • Propositional variable • Public-Key Cryptography • Quantifier (logic) • Random Variable • Recursion (computer science) • Regular Expression • result • Sample space • Series (mathematics) • Set (mathematics) • Sign (mathematics) • Square (algebra) • String (computer science) • Subset • Substitution cipher • Summation • Tautology (logic) • Theorem • Theory of Computation • Traditional mathematics • truth table • Variable (computer science) • Variable (mathematics) • Weighted arithmetic mean
• ISBN-10: 0-691-19061-5 / 0691190615
• ISBN-13: 978-0-691-19061-7 / 9780691190617