Data Structures and Algorithms

The authors' treatment of data structures in Data Structures and Algorithms is unified by an informal notion of "abstract data types," allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.

Customer Reviews:

The best introduction to the field - a pleasure to read

By Optimistix - February 9, 2002

A textbook by Aho/Hopcroft/Ullman is sort of a guarantee of quality -
and this one is no exception. These people are among the greatest
researchers and teachers in Computer Science, and this book is a
great opportunity to 'learn from the masters'. As an introduction to the fascinating field of Data Structures and
Algorithms, this is perhaps the best textbook you'll find out there.
Starting with the basics, the authors develop the concepts in a
natural manner. Array, lists and stacks soon give way to binary trees,
heaps and then more advanced data structures. All data structures are
introduced with proper motivation in terms of the kind of problems
that they are useful in solving. The basic algorithms in searching, sorting, and graphs are then presented
in detail, followed by a chapter on algorithm analysis techniques, and
one on design paradigms such as dynamic programming, backtracking, divide... read more

A classic text on programming

By Ganapathy Subramaniam - October 1, 2001

This book stands out among countless books written on the subject. It basically deals with the two ingrediants of programming ,
Data Structures and Algorithms.The first part gives a wonderful introduction to the concept of Data Structures.It goes on to deal with several classes of Data Structures such as lists, stacks, queues, trees and graphs..
This book is profusely illustrated with examples, and lots of exercises for the student to expand upon the ideas. The next part goes on to deal with Algorithms. Beginning with the concept, approaches, and different metrics that quantify algorithms such as time and space complexity. Common problems such as sorting , searching and the different algorithms are elaborated with the pros and cons. One nice thing about the text is the way the subject is presented to the reader. Each topic begins with a few basic concepts and then extended in a natural manner to reach the complexity. This especially equips the student with the... read more

Still the Best

By Carlo Cosenza - March 1, 2000

From a students perspective this text has it all. Instead of relying on C/C++ to teach the concept of ADTs, this text uses a pseudocode based on Pascal. Consequently, all algorithms presented in this text are clear and easy to understand. Implementation of ADTs is thus facilitated by using the clear framework provided in this wonderful text.