Discrete Mathematics for Computer Science

Large book cover: Discrete Mathematics for Computer Science

Discrete Mathematics for Computer Science

Publisher: arXiv
ISBN/ASIN: 1441980466
Number of pages: 255

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual (after all, programs may not terminate for all input) and I provide a fairly complete account of the basic concepts of graph theory.

Home page url

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

Similar books

Book cover: Languages and MachinesLanguages and Machines
by - Macquarie University
This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.
Book cover: Notes on Discrete MathematicsNotes on Discrete Mathematics
Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.
Book cover: Applied Finite MathematicsApplied Finite Mathematics
by - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
Book cover: A Spiral Workbook for Discrete MathematicsA Spiral Workbook for Discrete Mathematics
by - Open SUNY Textbooks
This textbook covers the standard topics in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics. It explains and clarifies the unwritten conventions in mathematics.