**Mathematics for Computer Science**

by Eric Lehman, F Thomson Leighton, Albert R Meyer

**Publisher**: MIT 2010**Number of pages**: 557

**Description**:

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

**Languages and Machines**

by

**C. D. H. Cooper**-

**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.

(

**17048**views)

**A Spiral Workbook for Discrete Mathematics**

by

**Harris Kwong**-

**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.

(

**4163**views)

**Mathematics for Algorithm and Systems Analysis**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

(

**27426**views)

**Applied Finite Mathematics**

by

**Rupinder Sekhon**-

**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.

(

**9880**views)