Programming Books C Java PHP Python Learn more Browse Programming Books
  • List Price: $74.20
  • Save: $47.21 (64%)
Rented from Amazon Warehouse Deals
To Rent, select Shipping State from options above
Due Date: Dec 19, 2014
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Qty:1
  • List Price: $74.20
  • Save: $18.55 (25%)
Only 11 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Have one to sell? Sell on Amazon
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 Paperback – January 11, 1983

ISBN-13: 978-0201000238 ISBN-10: 0201000237 Edition: 1st

Buy New
Price: $55.65
Rent
Price: $26.99
28 New from $47.95 56 Used from $9.00
Amazon Price New from Used from
Paperback
"Please retry"
$55.65
$47.95 $9.00

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student



Frequently Bought Together

Data Structures and Algorithms + The Design and Analysis of Computer Algorithms + Introduction to Algorithms
Price for all three: $189.04

Buy the selected items together

NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Paperback: 427 pages
  • Publisher: Addison-Wesley; 1st edition (January 11, 1983)
  • Language: English
  • ISBN-10: 0201000237
  • ISBN-13: 978-0201000238
  • Product Dimensions: 9.2 x 6.3 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 (14 customer reviews)
  • Amazon Best Sellers Rank: #254,074 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.2 out of 5 stars
5 star
6
4 star
5
3 star
3
2 star
0
1 star
0
See all 14 customer reviews
I found this book to be detailed and very good at explaining things.
Joe Jevnik
As an introduction to the fascinating field of Data Structures and Algorithms, this is perhaps the best textbook you'll find out there.
Optimistix
I highly recommend this book for any one seriously interested in programming.
Ganapathy Subramaniam

Most Helpful Customer Reviews

61 of 63 people found the following review helpful By Optimistix on February 9, 2002
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.
Read more ›
2 Comments 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
25 of 25 people found the following review helpful By Ganapathy Subramaniam on October 1, 2001
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.
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
21 of 21 people found the following review helpful By Carlo Cosenza on March 1, 2000
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.
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
15 of 15 people found the following review helpful By A Customer on June 30, 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
9 of 9 people found the following review helpful By Master "Chief of Barter Town" Blaster on January 15, 2006
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.
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
5 of 6 people found the following review helpful By A Comp Science Instructor on May 18, 2005
Format: Paperback
I believe two books make a classic collection in data structures - one was the data structures book by sartaj sahni (his first edition book many years ago - I haven't looked at his recent books). That was the book I had to study when I was an undergrad student. Now I was entrusted with the task of teaching Data Structures and after looking at several books, this is the one I chose (may be because it comes most close to the style of teaching using psuedo-pascal that I grew up with).

I believe psuedo languages are the best way to learn concepts of any computer science area without getting bogged down in the nitty gritty of a language's syntax and semantics. I found the problems at the end of the chapters to be thoughtful and not extremely hard for undergraduate students. This book also goes into brief mathematical aspects of analysing the complexity of algorithms where necessary. The mathematical analysis is usually the part that most undergrad students moan and groan about, but they better get used to it IMO, if they wish to elevate themselves from the ranks of "a programmer" to an software / algorithm designer.

I have to agree that this book can be extremely hard for the weaker students in the class who have never had any programming or basic college algebra exposure. For all others, this book should be great.
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 Recent Customer Reviews

Search

What Other Items Do Customers Buy After Viewing This Item?