Elementary Computer Mathematics
by Kenneth R. Koehler
Publisher: University of Cincinnati Blue Ash College 2002
Number of pages: 223
This hypertextbook is an introduction to the mathematics used in the design of computer and network hardware and software. Its goal is to prepare the student for further coursework in such areas as hardware architecture, operating systems internals, application programming, databases and networking. In it, we will survey topics in computer arithmetic and data representation, logic and set theory, graph theory and computer measurement.
Home page url
Download or read it online for free here:
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 Miguel A. Lerma
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.
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.
by J. G. Kemeny, J. L. Snell, G. L. Thompson - 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.