- Pub. Date:
- Cambridge University Press
By the time students have done some programming in one or two languages and have learnt the common ways of representing information in a computer, they will want to embark upon further study of theoretical or applied topics in computer science. Most will encounter problems that require for their solution one or more of the techniques described in this book: for example problems depending upon the formation and solution of different equations; the task of making lists of possible alternatives and of answering questions about them; or the search for discrete optima. Written by the same authors as the highly successful Information Representation and Manipulation in a Computer, this book describes algorithms of mathematical methods and illustrates their application with examples. The mathematical background needed is elementary algebra and calculus. Numerous exercises are provided, with hints to their solutions.
|Publisher:||Cambridge University Press|
|Series:||Cambridge Computer Science Texts Series|
|Product dimensions:||6.00(w) x 8.90(h) x 0.70(d)|
Table of Contents
Preface; 1. The problems of computational combinatorics; 2. Constant coefficient difference equations; 3. Other difference equations; 4. elementary configurations; 5. Ordering and generation of elementary configurations; 6. Search procedures; 7. Theorems and algorithms for selection; Notes on the solutions to exercises; Index.