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
The Design of Approximation Algorithmsby D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(15988 views)
Greedy Algorithmsby Witold Bednorz - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
(15115 views)
Algorithmic Mathematicsby Leonard Soicher, Franco Vivaldi - Queen Mary University of London
This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.
(24041 views)
Data Structures and Algorithm Analysis in C++by Clifford A. Shaffer - Dover Publications
A comprehensive treatment focusing on efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ programming language and is suitable for second-year courses.
(23652 views)