Bibliographic Information

Mathematics for computer science

A. Arnold and I. Guessarian

(Prentice-Hall International series in computer science)

Prentice Hall, 1996

  • : pbk

Available at  / 15 libraries

Search this Book/Journal

Note

Includes index

Description and Table of Contents

Description

This Text Provides the essential mathematics needed to study computing. The authors are aware that many student do not have the same mathematical background common 5 years ago and this book has been written to accommodate these changes.Many exercises are provided with detailed answers and difficult concepts are thoroughly illustrated to help learning. Chapters are designed to be read in isolation with interdependence between chapters minimalised.

Table of Contents

Introduction. Sets and Functions. Ordered Sets, Recursion and Induction. Boolean Algebras. Combinational Algebra and Applications Recurrences Generating Series. Asympotic Behaviour. Graphs and Trees.Rational Languages Finite Automatal Discrete Probabilities. Finite Markov Chains. Applications and Examples. Answers to all Exercises. Index.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

Page Top