*Discrete Mathematics with Algorithms*, by M. O. Albertson and J. P. Hutchinson, is a first-year course in discrete mathematics.

**Description**

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. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).

**Table of Contents**

- Sets and Algorithms: An Introduction
- Arithmetic, Arithmetic of Sets
- Number Theory
- Graph Theory
- Searching and Sorting
- Recurrence Relations
- More Graph Theory

**Book Details**

Publisher: Wiley

Format(s): PDF

File size: –

Number of pages: 560

Link: Discrete Mathematics with Algorithms [PDF]