FREE Delivery in the UK.
Only 2 left in stock.
Dispatched from and sold by Amazon.
Gift-wrap available.
Quantity:1
Data Structures and Algor... has been added to your Basket
+ £2.80 UK delivery
Used: Good | Details
Condition: Used: Good
Comment: Good Condition item. We strive to provide the best shopping experience with every item we sell. Satisfaction guaranteed!! Ships from US. Please allow 1-3 weeks for delivery
Trade in your item
Get a £3.81
Gift Card.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr) Paperback – 1 Jan 1983


See all 3 formats and editions Hide other formats and editions
Amazon Price New from Used from
Hardcover
"Please retry"
£45.44
Paperback
"Please retry"
£40.99
£38.18 £15.65

Frequently Bought Together

Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr) + The Design and Analysis of Computer Algorithms (Series in Computer Science & Information Processing)
Price For Both: £86.51

Buy the selected items together


Trade In this Item for up to £3.81
Trade in Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr) for an Amazon Gift Card of up to £3.81, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Product details

  • Paperback: 400 pages
  • Publisher: Addison Wesley; 1 edition (1 Jan. 1983)
  • Language: English
  • ISBN-10: 0201000237
  • ISBN-13: 978-0201000238
  • Product Dimensions: 15.8 x 2.4 x 23 cm
  • Average Customer Review: 4.2 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Bestsellers Rank: 566,406 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, and more.

Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

4.2 out of 5 stars
Share your thoughts with other customers

Most Helpful Customer Reviews

3 of 3 people found the following review helpful By A Customer on 1 July 1999
Format: Paperback
I was lucky enough to take a course in Data Structures and Algorithms with Prof. Aho and this was the text. Probably the best I have ever used. As friends and associates went through school they would invariably throw away the book they'd bought for their Data Structures course and buy a copy of this. Clear, concise, full of good code. A must
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 3 people found the following review helpful By A Customer on 2 Dec. 1998
Format: Paperback
This book is very good but if you are looking for information on AVL trees and other advanced concepts in Data Structures look at Donanld Knuth. This book is not for beginners and is a very dense book.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
0 of 3 people found the following review helpful By Meemaw on 5 Feb. 2013
Format: Paperback Verified Purchase
I have no knowledge of this item as it was a Birthday gift. The recipient however, was very pleased with it . The item arrived within the dates given and was in excellent order. Excellent service
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
0 of 3 people found the following review helpful By A Customer on 29 May 1999
Format: Paperback
The text covers the material on data structures, sometimes it is hard to understand. A super text on data structure logic is Data Structures A Pseudocode Approach with C. by Rich Gilberg
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: 17 reviews
61 of 63 people found the following review helpful
The best introduction to the field - a pleasure to read 10 Feb. 2002
By Optimistix - Published on Amazon.com
Format: Paperback
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.
26 of 26 people found the following review helpful
A classic text on programming 2 Oct. 2001
By Ganapathy Subramaniam - Published on Amazon.com
Format: Paperback
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.
21 of 21 people found the following review helpful
Still the Best 2 Mar. 2000
By Carlo Cosenza - Published on Amazon.com
Format: Paperback
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.
15 of 15 people found the following review helpful
The Best Intro To Data Structures and Algorithms 1 July 1999
By A Customer - Published on Amazon.com
Format: Paperback
I was lucky enough to take a course in Data Structures and Algorithms with Prof. Aho and this was the text. Probably the best I have ever used. As friends and associates went through school they would invariably throw away the book they'd bought for their Data Structures course and buy a copy of this. Clear, concise, full of good code. A must
9 of 9 people found the following review helpful
A JEWEL 15 Jan. 2006
By Master "Chief of Barter Town" Blaster - Published on Amazon.com
Format: Paperback
Perfect book. Nice and small. You can buy it cheap too, it's old. But it's full of the meat and potatoes, no fluffy Java source code. Sure, it uses Pascal, but it's not that hard to understand Pascal code even if you never programmed in Pascal (me neither). What matters is the discussions behind the scenes. It covers the whole range of what you should know and it's concise. They don't write books like this anymore.
Were these reviews helpful? Let us know


Feedback