**Algorithms**

by Ian Craw, John Pulham

**Publisher**: University of Aberdeen 1999**Number of pages**: 120

**Description**:

This course studies computer algorithms, considering their construction, validation and effectiveness. After a general introduction to the subject a number of specific topics will be covered: the problem of sorting data sets into order, the theory of formal grammars and problems such as the parsing of arithmetic expressions, the construction and use of pseudorandom numbers.

Download or read it online for free here:

**Download link**

(930KB, PDF)

## Similar books

**Modern Computer Arithmetic**

by

**Richard P. Brent, Paul Zimmermann**-

**LORIA**

This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.

(

**8502**views)

**Computer Arithmetic of Geometrical Figures: Algorithms and Hardware Design**

by

**Solomon I. Khmelnik**-

**MiC**

This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.

(

**4777**views)

**Randomized Algorithms**

by

**Wolfgang Merkle**-

**ESSLLI**

The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.

(

**5480**views)

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

**Now Publishers**

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.

(

**6246**views)