- Hardcover: 672 pages
- Publisher: Addison-Wesley Professional; 3 edition (July 17 1997)
- Language: English
- ISBN-10: 0201896834
- ISBN-13: 978-0201896831
- Product Dimensions: 24.5 x 16.9 x 3.6 cm
- Shipping Weight: 1.1 Kg
- Average Customer Review: 4.2 out of 5 stars See all reviews (40 customer reviews)
- Amazon Bestsellers Rank: #147,207 in Books (See Top 100 in Books)
- See Complete Table of Contents
|
||||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
| ||||||||||||
Product Details |
Product Description
From Amazon
This magnificent tour de force presents a comprehensive overview of a wide variety of algorithms and the analysis of them. Now in its third edition, The Art of Computer Programming, Volume I: Fundamental Algorithms contains substantial revisions by the author and includes numerous new exercises.
Although this book was conceived several decades ago, it is still a timeless classic. One of the book's greatest strengths is the wonderful collection of problems that accompany each chapter. The author has chosen problems carefully and indexed them according to difficulty. Solving a substantial number of these problems will help you gain a solid understanding of the issues surrounding the given topic. Furthermore, the exercises feature a variety of classic problems.
Fundamental Algorithms begins with mathematical preliminaries. The first section offers a good grounding in a variety of useful mathematical tools: proof techniques, combinatorics, and elementary number theory. Knuth then details the MIX processor, a virtual machine architecture that serves as the programming target for subsequent discussions. This wonderful section comprehensively covers the principles of simple machine architecture, beginning with a register-level discussion of the instruction set. A later discussion of a simulator for this machine includes an excellent description of the principles underlying the implementation of subroutines and co-routines. Implementing such a simulator is an excellent introduction to computer design.
In the second section, Knuth covers data structures--stacks, queues, lists, arrays, and trees--and presents implementations (in MIX assembly) along with techniques for manipulating these structures. Knuth follows many of the algorithms with careful time and space analysis. In the section on tree structures, the discussion includes a series of interesting problems concerning the combinatorics of trees (counting distinct trees of a particular form, for example) and some particularly interesting applications. Also featured is a discussion of Huffmann encoding and, in the section on lists, an excellent introduction to garbage collection algorithms and the difficult challenges associated with such a task. The book closes with a discussion of dynamic allocation algorithms.
The clear writing in Fundamental Algorithms is enhanced by Knuth's dry humor and the historical discussions that accompany the technical matter. Overall, this text is one of the great classics of computer programming literature--it's not an easy book to grasp, but one that any true programmer will study with pleasure.
Book Description
Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.
The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e
ISBN: 0321751043
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product)
|
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most helpful customer reviews
2.0 out of 5 stars
Boring,
By Dan Rippel (drippel@perspect.com) (Vienna, VA) - See all my reviews
This review is from: Art of Computer Programming, Volume 1: Fundamental Algorithms (Hardcover)
How can someone who supports the notion of Literate Programing write something this dull and write code examples in such an obscure and trivial language? This is the same philosophy that keeps TEX in a black hole. Produce something powerful and full of features but then forget about making it user friendly. It's really a shame.
2 of 2 people found the following review helpful
5.0 out of 5 stars
Just try sorting and searching with out this book.,
By
This review is from: Art of Computer Programming, Volume 1: Fundamental Algorithms (Hardcover)
This book has saved my bacon several times through the decades. Once I needed to actually build a database package from scratch instead of using a commercial package.I almost did not buy it when all I saw in it was mostly math. But I was desperate and it paid off. Turns out you could not explain it any other way. I use it primarily for balanced trees. I may try some thing more exotic later. The set also looks impressive in the library.
1 of 1 people found the following review helpful
5.0 out of 5 stars
Back to basics,
By RP (Santa Clara, CA USA) - See all my reviews
This review is from: Art of Computer Programming, Volume 1: Fundamental Algorithms (Hardcover)
Its as good as it can be. In depth analysis(not that much breadth though) of basic algorithms. I would also recommend the 3rd volume of the series on sorting and searching.Its good for those who are willing to put lot of time and effort in studying it, one of the good things about the books are the problems at the end of each chapter. If you solve them ...hats off, you are a star programmer!!Some of the new data structures and algorithms are missing from the book, but I still think it deserves the 5 star for whats in there. I would also recommend The Algorithm Design Manual by Steven S. Skiena, Steve Skiena, that lists all the algorithm (that kind of covers the breadth) and their usage, specially the use cases.
Share your thoughts with other customers: Create your own review
Want to see more reviews on this item?
|
Most recent customer reviews |
Listmania!
Look for similar items by category
- Books > Computers & Internet > Operating Systems
- Books > Computers & Internet > Programming > Algorithms
- Books > Computers & Internet > Programming > Software Design, Testing & Engineering > Software Development
- Books > Professional & Technical > Professional Science > Mathematics
- Books > Qualifying Textbooks - Fall 2007 > Computers & Internet
Look for similar items by subject
Feedback
Would you like to update product info or give feedback on images?
|
