Essential Discrete Mathematics for Computer Science
Rachel Zax, Harry Lewis
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Naturwissenschaften, Medizin, Informatik, Technik / Mathematik
A more intuitive approach to the mathematical foundation of computer science
Discrete 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 mathematics
- Features thirty-one short chapters, each suitable for a single class lesson
- Includes more than 300 exercises
- Almost every formula and theorem proved in full
- Breadth of content makes the book adaptable to a variety of courses
- Each chapter includes a concise summary
- Solutions manual available to instructors
Euler's theorem, Fermat's little theorem, Natural number, Weighted arithmetic mean, Computer program, Algorithm, Propositional variable, Optimization problem, String (computer science), Public-key cryptography, Recursion (computer science), Predicate logic, Mathematician, Regular expression, Set (mathematics), Propositional calculus, Parity (mathematics), Foundations of mathematics, Pigeonhole principle, Connectivity (graph theory), Master theorem, Function (mathematics), Number theory, Kruskal's algorithm, Multiplicity (mathematics), Arithmetic logic unit, Best, worst and average case, Disk (mathematics), Mathematical fallacy, Mathematical structure, Fundamental theorem of arithmetic, Binary search algorithm, Menger's theorem, Deterministic finite automaton, Bijection, Series (mathematics), Harmonic series (mathematics), Sign (mathematics), Linear algebra, Logical disjunction, Integer, Predicate (mathematical logic), Traditional mathematics, Deterministic automaton, Probability, Substitution cipher, Arithmetic, Arithmetic mean, Mathematical proof, Nondeterministic finite automaton, Expression (mathematics), Variable (computer science), Sample space, Prime number, Permutation, Polynomial, Theory of computation, Tautology (logic), Mathematical notation, Parameter (computer programming), Modular arithmetic, Inequality (mathematics), Binary logarithm, Binary number, Connected component (graph theory), Machine learning, Computer scientist, Discrete mathematics, Summation, Analysis of algorithms, Graph (discrete mathematics), Variable (mathematics), Discrete logarithm, Numerical integration, Gray code, Subset, Hash function, Logical connective, Graph coloring, Big O notation, Binary relation, Result, Mathematical induction, Mathematics, Diagram (category theory), Theorem, Square (algebra), Random variable, Concatenation (mathematics), Computation, Mathematical logic, Quantifier (logic), Arithmetic progression, Computer science, Element (mathematics), Plaintext, Applied mathematics, Truth table, Instance (computer science), Proportionality (mathematics)