- We will send in 10–14 business days.
/images/books/13161718/9783540760474.jpg)
- Author: Iain T Adamson
- Publisher: Springer
- Year: 1996
- Pages: 419
- ISBN-10: 3540760474
- ISBN-13: 9783540760474
- Format: 15.6 x 23.5 x 2.5 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
All young computer scientists who aspire to write programs must learn something about algorithms and data structures. This book does exactly that. Based on lecture courses developed by the author over a number of years the book is written in an informal and friendly way specifically to appeal to students.
The book is divided into four parts: the first on Data Structures introduces a variety of structures and the fundamental operations associated with them, together with descriptions of how they are implemented in Pascal; the second discusses algorithms and the notion of complexity; Part III is concerned with the description of successively more elaborate structures for the storage of records and algorithms for retrieving a record from such a structure by means of its key; and finally, Part IV consists of very full solutions to nearly all the exercises in the book.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 19d.14:47:36
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Iain T Adamson
- Publisher: Springer
- Year: 1996
- Pages: 419
- ISBN-10: 3540760474
- ISBN-13: 9783540760474
- Format: 15.6 x 23.5 x 2.5 cm, softcover
- Language: English English
All young computer scientists who aspire to write programs must learn something about algorithms and data structures. This book does exactly that. Based on lecture courses developed by the author over a number of years the book is written in an informal and friendly way specifically to appeal to students.
The book is divided into four parts: the first on Data Structures introduces a variety of structures and the fundamental operations associated with them, together with descriptions of how they are implemented in Pascal; the second discusses algorithms and the notion of complexity; Part III is concerned with the description of successively more elaborate structures for the storage of records and algorithms for retrieving a record from such a structure by means of its key; and finally, Part IV consists of very full solutions to nearly all the exercises in the book.
Reviews