|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
List Price: $68.80Amazon.com's Price: $55.04 You Save: $13.76 (20%)Prices subject to change.
Availability: Usually ships in 24 hours
This item ships for FREE with Super Saver Shipping.
Binding: Hardcover
Dewey Decimal Number: 001.642
EAN: 9780201000290
ISBN: 0201000296
Label: Addison-Wesley
Manufacturer: Addison-Wesley
Number Of Items: 1
Number Of Pages: 470
Publication Date: January 11, 1974
Publisher: Addison-Wesley
Studio: Addison-Wesley
Related Items:
Browse for similar items by category:
Average Rating: 
Rating:  -
The book used in my graduate Intro to Algorithms course, and I think the follow-on. While I am obviously not as well read in this subject as many of the other reviewers, I can say "it worked", and indeed worked well. A course that has a weak text or teacher will not inspire... A-H-O/DACA and Prof. Carlson made the material exciting, even to an "architecture guy". My interests in grad school in the early 80's revolved around tessellation automata (aka systolic arrays and other highly regular compute structures) and big steaming fast computer structures. A-H-O provided me with the best understanding of the kinds of problems faced by the computers which interested me the most, and the kinds of tools needed to understand computational impact and algorithmic structuring of solutions to them. I sincerely with I hadn't lost my copy with the hundreds of annotations in the margins.
Rating: -
One of the classics -- a readable and practical textbook with dozens of problems and projects. Great as a reference to basic data structures and algorithms, too!
Rating:  -
This is a good book. The problem is it is WAY out of date, so out of date that he describes Pidgin ALGOL as a high level computer language. Higher then assembly sure, but give me a break. What I do like about this book is it is not wordy, it explains the topics quickly without over complicating them. If your looking for a more mordern approch look else where.
Rating: -
When I was in grad school starting a course in the Analysis of Algorithms, our professor told us there were only two reasonable choices of text for the course. We could use Knuth TAOCP or AHU. Since we were all students, probably starving, we would use AHU.
Rating: -
Excluding Knuth's opera (another dimension), this (AHU) is about the other and only renowned classic algorithms book, deseverdly I'd say, together with Cormen-Leiserson-Rivest's (CLR) "Introduction to Algorithms". With the difference that the first and only edition of AHU has been written 16 years before the first (of the two) editions of CLR.
The two books are quite different in the language and formalism used: more formal and mathematical inclined AHU with respect to CLR. I'd say, the very classic style of his authors who have made history in the CS literature with their books (particularly 2 on algorithms and data structures, 2 on Computer Theory, 2 on Compilers, 1 on CS foundations): as these books have been used in most universities around the world for decades, they've proved to be real milestones in the education of thousands of students.
The books differ also in scope, since AHU is certainly not an encyclopedic collection as CLR does, with his roughly 500 pages ... Read More
Availability: Usually ships in 24 hours
|
Amazon Store 