Leseprobe
* Affiliatelinks/Werbelinks
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.
Essential Discrete Mathematics for Computer Science
Rachel Zax, Harry Lewis
* Affiliatelinks/Werbelinks
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
Beschreibung
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
Kundenbewertungen
Logical disjunction, Computation, Harmonic series (mathematics), Series (mathematics), Computer science, Binary number, Applied mathematics, Parity (mathematics), Modular arithmetic, Theory of computation, Foundations of mathematics, Multiplicity (mathematics), Proportionality (mathematics), Instance (computer science), Optimization problem, Binary relation, Mathematical logic, Mathematician, Probability, Quantifier (logic), Inequality (mathematics), Deterministic finite automaton, Fundamental theorem of arithmetic, Set (mathematics), Summation, Graph coloring, Random variable, Arithmetic logic unit, Computer scientist, Permutation, Propositional variable, Sign (mathematics), Concatenation (mathematics), Fermat's little theorem, Function (mathematics), Mathematical induction, Pigeonhole principle, Traditional mathematics, Bijection, Graph (discrete mathematics), Mathematics, Polynomial, Discrete mathematics, Natural number, Recursion (computer science), Binary logarithm, Binary search algorithm, Mathematical proof, Expression (mathematics), Result, Computer program, Predicate (mathematical logic), Variable (computer science), Gray code, Propositional calculus, Discrete logarithm, Regular expression, Hash function, Plaintext, Integer, Mathematical fallacy, Subset, Truth table, Algorithm, Square (algebra), Theorem, Master theorem, Public-key cryptography, Diagram (category theory), Variable (mathematics)