Data Structures and Algorithms

by Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman

This book presents the data structures and algorithms that underpin much of today's computer programming. The basis of this book is the material contained in the first six chapters of our earlier work, The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for external storage and memory management. As a consequence, this book should be suitable as a text for a first course on data structures and algorithms. The only prerequisite we assume is familiarity with some high-level programming language such as Pascal.

Genres: Computer Science, Programming, Algorithms, Nonfiction, Computers, Textbooks, Technology

Hardcover

Published January 1, 1987

Reviews

[Kai Weber · Rating 4 out of 5]

You might think, in a field like computer science a book from the 1980s might be useless, because development in computer science is progressing so fast. But that's not true. The basics, like data structures and algorithms, have been established from the 50s to 70s, and I found few difference between the topics discussed in this data structures book on the one hand and two more recent books that I've read on the topic. Having found that directed graphs are still directed graphs, b-trees are still b-trees, and quicksort is still quick, the age of an introductory book to algorithms obviously doesn't matter so much. Then what matters more is the way it's presenting and explaining things, the overall didactic structure. And from this point of view I found this edition here the most accessible introduction. The images are usually illuminating, the text is easily understandable. Some math formulas could be a little bit ominous, but that's the case to me in all those books on the topic that I've touched so far. Another little disadvantage that comes with the age is that all the programming code examples are given in Pascal. But even that is a manageable disadvantage: Even without any active proficiency in that outdated language, the examples are still readable and understandable to people with experience in Java or a newer programming idiom.

[Jérémy Dragon · Rating 4 out of 5]

A must read. Could be too long on some notions sometimes, but I plan to read it several times, and to make most of the exercises.

[Vinay Mayavanshi · Rating 3 out of 5]

Pretty Old book on DSA. Hasn't covered the concepts well. Not recommended for the beginners.

[André · Rating 3 out of 5]

Das Buch erschien 1983 und verwendet die Programmiersprache Pascal, erklärt aber klassische Algorithmen und elementare Datenstrukturen immer noch gut, va. kompakt (419 Seiten). Alfred Aho (J.v.Neumann-Medaille) et al behandeln hier Listen, Queues, Stacks, beschreiben Bäume & Graphenalgorithmen, Mengenoperationen & -abbildungen, Sortierverfahren usw. Das Buch enthält zudem Kapitel zur Analyse & zum Design von Algorithmen.

[Alpha]

Two stars are deducted for dated material and Pascal.

[Darrell Ulm · Rating 4 out of 5]

A historical favorite.

[Mayank Joshi]

good book

[Alexis · Rating 3 out of 5]

Wasn't what I was looking for but still good.