**A Computer Science Tapestry: Exploring Computer Science with C++**

by Owen L. Astrachan

**Publisher**: McGraw - Hill 1999**ISBN/ASIN**: 0072322039**ISBN-13**: 9780072322033**Number of pages**: 879

**Description**:

This book is designed for a first course in computer science that uses C++ as the language by which programming is studied. The goal has not been to cover the syntax of a large language like C++, but to leverage the best features of the language using sound practices of programming and pedagogy in the study of computer science and software design.

Download or read it online for free here:

**Download link**

(4.4MB, PDF)

## Similar books

**Delftse Foundations of Computation**

by

**Stefan Hugtenburg, Neil Yorke-Smith**-

**TU Delft Open**

This is a textbook for a one quarter introductory course in theoretical computer science. It includes topics from propositional and predicate logic, proof techniques, set theory and the theory of computation, along with practical applications to CS.

(

**981**views)

**Common LISP: A Gentle Introduction to Symbolic Computation**

by

**David S. Touretzky**-

**Benjamin-Cummings Pub Co**

This is a gentle introduction to Common Lisp for students taking their first programming course. No prior mathematical background beyond arithmetic is assumed. There are lots of examples, the author avoided technical jargon.

(

**18527**views)

**Introduction to Soft Computing**

by

**Eva Volna**-

**Bookboon**

This book gives an introduction to Soft Computing, which aims to exploit tolerance for imprecision, uncertainty, approximate reasoning, and partial truth in order to achieve close resemblance with human like decision making.

(

**4454**views)

**Building Blocks for Theoretical Computer Science**

by

**Margaret M. Fleck**-

**University of Illinois, Urbana-Champaign**

This book provides a survey of basic mathematical objects, notation, and techniques useful in later computer science courses. It gives a brief introduction to some key topics: algorithm analysis and complexity, automata theory, and computability.

(

**7371**views)