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

**Temporal Networks**

by

**Petter Holme, Jari SaramÃ¤ki**-

**arXiv**

In this review, the authors present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamic systems.

(

**6759**views)

**Discrete Differential Geometry: An Applied Introduction**

by

**M. Desbrun, P. Schroeder, M. Wardetzky**-

**Columbia University**

This new and elegant area of mathematics has exciting applications, as this text demonstrates by presenting practical examples in geometry processing (surface fairing, parameterization, and remeshing) and simulation (of cloth, shells, rods, fluids).

(

**9327**views)

**Lecture Notes in Discrete Mathematics**

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.

(

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

(

**21583**views)