Data Structures and Algorithms: A First Course

✍ Scribed by Iain T. Adamson BSc, MSc, AM, PhD (auth.)

• Publisher: Springer-Verlag London
• Year: 1996
• Tongue: English
• Leaves: 411
• Edition: 1
• Category: Library

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

✦ Table of Contents

Front Matter....Pages i-xi
Front Matter....Pages 1-4
Arrays, Records and Linked Lists....Pages 5-25
Stacks and Queues....Pages 27-56
Binary Trees....Pages 57-73
Heaps....Pages 75-86
Graphs....Pages 87-109
Front Matter....Pages 111-111
Algorithms and Complexity....Pages 113-125
Sorting Algorithms....Pages 127-170
Graph Algorithms....Pages 171-213
Some Miscellaneous Algorithms....Pages 215-234
Front Matter....Pages 235-237
Storing in Arrays and Lists....Pages 239-255
Storing in Binary Trees....Pages 257-278
Storing in Multiway Trees....Pages 279-307
Front Matter....Pages 309-309
Solutions to Exercises 1....Pages 311-320
Solutions to Exercises 2....Pages 321-327
Solutions to Exercises 3....Pages 329-336
Solutions to Exercises 4....Pages 337-340
Solutions to Exercises 5....Pages 341-345
Solutions to Exercises 6....Pages 347-348
Solutions to Exercises 7....Pages 349-361
Solutions to Exercises 8....Pages 363-373
Front Matter....Pages 309-309
Solutions to Exercises 9....Pages 375-379
Solutions to Exercises 10....Pages 381-386
Solutions to Exercises 11....Pages 387-396
Solutions to Exercises 12....Pages 397-415
Back Matter....Pages 417-419

✦ Subjects

Data Structures; Algorithm Analysis and Problem Complexity