**Discrete Mathematics with Algorithms**

by M. O. Albertson, J. P. Hutchinson

**Publisher**: J. Wiley 1988**ISBN/ASIN**: 0471849022**ISBN-13**: 9780471849025**Number of pages**: 560

**Description**:

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 (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in English, in a format compatible with the Pascal programming language.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Discrete Mathematics for Computer Science**

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.

(

**9853**views)

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

(

**14691**views)

**Exploring Discrete Mathematics Using Maple**

by

**Kenneth H. Rosen**-

**Mcgraw-Hill College**

This is a guide to help you explore concepts in discrete mathematics using the computer system Maple. It is designed to be accessible to those who are complete novices with Maple and with computer programming, but it has much to offer even experts.

(

**3638**views)

**Discrete Math for Computer Science Students**

by

**Ken Bogart, Cliff Stein**-

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

(

**3955**views)