Mathematics for Computer Science
by Eric Lehman, F Thomson Leighton, Albert R Meyer
Publisher: MIT 2010
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:
by Marcel B. Finan - Arkansas Tech University
This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in computer science, engineering, Business, and the sciences.
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.
by Jean Gallier - arXiv
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.
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.