Data Structures and Algorithms (Paperback)

~ (Author), (Author), (Author)
Key Phrases: left buddy count, endmarker bit, shortest special path, Fred Jones, World Series, Bibliographic Notes Knuth (more...)

Editorial Reviews

Product Description

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.

Product Details

• Paperback: 427 pages
• Publisher: Addison Wesley (January 11, 1983)
• Language: English
• ISBN-10: 0201000237
• ISBN-13: 978-0201000238
• Product Dimensions: 9.3 x 6.4 x 0.9 inches
• Shipping Weight: 1.6 pounds (View shipping rates and policies)
• Average Customer Review: 4.2 out of 5 stars  See all reviews (12 customer reviews)
• Amazon.com Sales Rank: #96,455 in Books (See Bestsellers in Books)

  Popular in these categories: (What's this?)

  #1 in	Books > Computers & Internet > Programming > Algorithms > Data Structures
  #10 in	Books > Computers & Internet > Programming > Software Design, Testing & Engineering > Structured Design
  #33 in	Books > Computers & Internet > Databases > Database Design

Customer Reviews

Most Helpful Customer Reviews

45 of 47 people found the following review helpful:

5.0 out of 5 stars The best introduction to the field - a pleasure to read, February 9, 2002

By	"optimistix" (London, UK) - See all my reviews

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
and conquer, greedy approach, and local search. The book ends with chapters
data structures and algorithms for external storage and memory management.

This is a textbook, and therefore you can expect a fair amount of maths
in the analysis of algorithms, without which you can only do hand-waving.
All algorithms are explained, with detailed examples and illustrations -
this is one of the easiest books to follow in theoretical computer science.

All algorithms are presented in pseudocode, which makes it easier to
understand things at an abtract level without getting bogged down in
language specific technical details, and the pseudocode is very clear
and concise, making it an easy task to adapt it to any given language.

An additional plus-point is its size - weighing in at less than 450
pages, this is a 'backpack friendly' book which you can easily carry
around, unlike many others on the subject.

The only caveat is that the book is almost 20 years old, so you won't
find the more recent topics like red-black trees, skip lists etc.
I'd suggest using this book for an introduction to the basics, with the
book by Cormen et al (if you want the maths) or Sedgewick (if you don't
want the maths) as excellent supplements as well as advanced references.

I must confess to having a weak spot for this book, since it introduced
me to algorithms and i fell in love with the subject. However, i think
most people who've read it would agree that it is a classic among Computer
Science textbooks which has stood the test of time.

19 of 19 people found the following review helpful:

5.0 out of 5 stars A classic text on programming, October 1, 2001

By	Ganapathy Subramaniam (Chennai, Tamil Nadu, India) - See all my reviews (REAL NAME)

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 ability to continue evolving the solutions on their own. Not to mention the numerous exercises.
For example by studying the concept of abstract data types one would understand how OO programming evolves naturally.

I highly recommend this book for any one seriously interested in programming.

15 of 15 people found the following review helpful:

5.0 out of 5 stars Still the Best, March 1, 2000

By	Carlo Cosenza (USA) - See all my reviews

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.