Data Structures and Algorithms : A First Course

Iain T. Adamson

ISBN 10: 3540760474 / ISBN 13: 9783540760474

Published by Springer, Berlin, 1996

About this Item

Neuware - 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.

Seller Inventory # 9783540760474

Bibliographic Details

• Title: Data Structures and Algorithms : A First Course
• Publisher: Springer, Berlin
• Publication Date: 1996
• Language: English
• ISBN 10: 3540760474
• ISBN 13: 9783540760474
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 23.5W x 15.5H x 0D centimeters 23.5 centimeters width by 15.5 centimeters height by 0 centimeters depth
• Weight: 652 grams

About this title

Synopsis

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.