Mathematics for Computer Science

Small book cover: Mathematics for Computer Science

Mathematics for Computer Science

Publisher: MIT
Number of pages: 557

This text offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, elementary number theory; Discrete structures: graphs, counting; Discrete probability theory.

Download or read it online for free here:
Download link
(3.2MB, PDF)

Similar books

Book cover: Discrete Math for Computer Science StudentsDiscrete Math for Computer Science Students
by - Dartmouth College
It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
Book cover: Introduction To Finite MathematicsIntroduction To Finite Mathematics
by - Prentice-Hall
This book introduces college students to the elementary theory of logic, sets, probability theory, and linear algebra and treats a number of applications either from everyday situations or from applications to the biological and social sciences.
Book cover: Discrete Mathematics with AlgorithmsDiscrete Mathematics with Algorithms
by - J. Wiley
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...
Book cover: Discrete StructuresDiscrete Structures
by - Stanford University
Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.