Buy new:
-24% $76.00$76.00
Delivery Tuesday, October 15
Ships from: Amazon Sold by: Titus Books Store
Save with Used - Good
$10.74$10.74
Delivery October 14 - 23
Ships from: Amazon Sold by: Books For You Today
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Data Structures and Algorithms First Edition
Purchase options and add-ons
- ISBN-100201000237
- ISBN-13978-0201000238
- EditionFirst Edition
- PublisherPearson
- Publication dateJanuary 1, 1983
- LanguageEnglish
- Dimensions9.22 x 6.29 x 0.93 inches
- Print length448 pages
Frequently bought together

Customers who bought this item also bought
Design and Analysis of Computer Algorithms, ThePaperback$13.68 shippingOnly 3 left in stock (more on the way).
Editorial Reviews
From the Back Cover
Product details
- Publisher : Pearson; First Edition (January 1, 1983)
- Language : English
- Hardcover : 448 pages
- ISBN-10 : 0201000237
- ISBN-13 : 978-0201000238
- Item Weight : 1.6 pounds
- Dimensions : 9.22 x 6.29 x 0.93 inches
- Best Sellers Rank: #1,210,413 in Books (See Top 100 in Books)
- Customer Reviews:
About the authors

Alfred Vaino Aho (born August 9, 1941) is a Canadian computer scientist best known for his work on programming languages, compilers, and related algorithms, and his textbooks on the art and science of computer programming.
Bio from Wikipedia, the free encyclopedia.

Discover more of the author’s books, see similar authors, read book recommendations and more.

Jeffrey David "Jeff" Ullman (born November 22, 1942) is a computer scientist and professor at Stanford University. His textbooks on compilers (various editions are popularly known as the Dragon Book), theory of computation (also known as the Cinderella book), data structures, and databases are regarded as standards in their fields.
Bio from Wikipedia, the free encyclopedia.
Related products with free delivery on eligible orders
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
-Covers a lot
-Good for self-motivated study, if using with other references
-Illustrations are good for overall data structures
Cons:
-Doesn't provide full implementations of most data structures
-Dense text, the author often takes a lot of words to say little
-At the same time, the author does not spend enough time on certain data types
-Along with actually implementing more methods, illustrations of methods would help
-If you don't have a strong math background, explanations of algorithms will go right over your head
The CONTENT of the books is wonderful; marvelous; and if you learn it you will be on your way to be a great computer scientist.
The PRINTING, by once great but now low quality Addison-Wesley... is a whole other matter. The book binding is almost ripping after 2 weeks of reading; the paper is garbage, and the ink is also very poor.
Wonderful books to have. Perhaps in digital form; but not these garbage Addison-Wesley copies. These are pretty lame.
epic book 5 stars - poor website description
Top reviews from other countries
y lo tenía en la lista para "compar algún día".
Es Nostalgia, pero si volviera a estudiar la carrera lo volvería a consultar.
Reviewed in Germany on March 24, 2023
Pros:
1. Theoretical aspects (proofs, etc.) have been addressed as and when required.
2. Clear and concise explanation style.
3. Many linear & non-linear data structures have been addressed here. After this book, you should consult "Introduction to Algorithms by CLRS" for further reading.





