Blick ins Buch

Data Structures and Algorithms: A First Course

Iain T. Adamson (Autor)

Buch | Softcover

XI, 419 Seiten

1996 | 1. Softcover reprint of the original 1st ed. 1996
Springer Berlin (Verlag)
978-3-540-76047-4 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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.

I Data Structures.- 1 Arrays, Records and Linked Lists.- 2 Stacks and Queues.- 3 Binary Trees.- 4 Heaps.- 5 Graphs.- II Algorithms.- 6 Algorithms and Complexity.- 7 Sorting Algorithms.- 8 Graph Algorithms.- 9 Some Miscellaneous Algorithms.- III Storing and Searching.- 10 Storing in Arrays and Lists.- 11 Storing in Binary Trees.- 12 Storing in Multiway Trees.- IV Solutions.- 13 Solutions to Exercises 1.- 14 Solutions to Exercises 2.- 15 Solutions to Exercises 3.- 16 Solutions to Exercises 4.- 17 Solutions to Exercises 5.- 18 Solutions to Exercises 6.- 19 Solutions to Exercises 7.- 20 Solutions to Exercises 8.- 21 Solutions to Exercises 9.- 22 Solutions to Exercises 10.- 23 Solutions to Exercises 11.- 24 Solutions to Exercises 12.

Erscheint lt. Verlag	6.8.1996
Zusatzinfo	XI, 419 p.
Verlagsort	London
Sprache	englisch
Maße	155 x 235 mm
Gewicht	648 g
Themenwelt	Mathematik / Informatik ► Informatik ► Datenbanken
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Schlagworte	Algorithm analysis and problem complexity • Algorithmen • algorithms • Complexity • data structures • Datenstrukturen • Hashing • HC/Informatik, EDV/Informatik • sorting
ISBN-10	3-540-76047-4 / 3540760474
ISBN-13	978-3-540-76047-4 / 9783540760474
Zustand	Neuware