ISBN-10:
0201485419
ISBN-13:
9780201485417
Pub. Date:
09/01/1998
Publisher:
Addison-Wesley
The Art of Computer Programming Volumes 1-3 Boxed Set / Edition 3

The Art of Computer Programming Volumes 1-3 Boxed Set / Edition 3

by Donald E. Knuth

Hardcover

Current price is , Original price is $199.99. You

Temporarily Out of Stock Online

Please check back later for updated availability.

This item is available online through Marketplace sellers.

Product Details

ISBN-13: 9780201485417
Publisher: Addison-Wesley
Publication date: 09/01/1998
Edition description: REV
Product dimensions: 7.00(w) x 10.00(h) x 5.00(d)

About the Author

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews

The Art of Computer Programming Volumes 1-3 Boxed Set 4.4 out of 5 based on 0 ratings. 14 reviews.
EmreSevinc on LibraryThing 10 months ago
"I thought that I was a perfectionist until I met Knuth." The previous sentence is from the renowned mathematician Fan Rong K Chung Graham and I think it also reflects the spirit of the masterpiece of Knuth, The Art of Computer Programming (TAOCP). Reading the book was pure intellectual indulgence and a striking experience for me. I'm not a computer scientist in the academic sense but rather a professional programmer with engineering and mathematics background so I don't think I can criticize the book at the level it deserves, I simply do not own that much technical breadth and depth. But I can easily say that this is one of the books which I can call a masterpiece without hesitation and unlike many other technical books I read, it broadened my horizons in fundamental aspects of computing science, such as randomness and relationships between superficially unrelated mathematical structures. Some may think that this masterpiece is rather theoretical and not very applicable in daily programming tasks but did you also know that this book is mentioned in Mitnick's 'The Art of Intrusion: The Real Stories Behind the Exploits of Hackers, Intruders and Deceivers' where a group of hackers try to analyze some slot machines and one of them visits the library to learn more about the random number generation algorithms and picks up TAOCP?I believe every programmer will find at least a few pages of pure hacker's delight in TAOCP and thus this book belongs to the shelf of every programmer.
Murdocke23 on LibraryThing 10 months ago
I'd be smarter after reading the material in these volumes, but I'd also be much older... From one of the gurus...Very, very in-depth. Done from a textbook POV, with explanations and many exercises. Examples and presentation can be awkward. Sedgewick's Algorithms in Java may be a better one to tackle.
coclimber on LibraryThing 10 months ago
Just seeing this title again brought back many memories of this being the "bible" of computer science back in my grad school days -- a very, very, very long time ago. Knuth's volumes were absolutely the "go to" books for many of our courses. Perhaps they's seem dated now, but still they'd provide a very solid foundation for anyone serious about programming / computing / software development / etc.
peterallenwebb on LibraryThing More than 1 year ago
There's no doubt that this is a landmark publication in the field of computer science, but it's tough going. The material is only really suitable for an advanced undergrad or graduate student. A command of basic calculus, combinatorics, and probability is a prerequisite to many of the chapters. Also, you should already know a good deal about how computers work and how to program. This is not an introduction to any of those subjects.Knuth's style is a little strange (geeky?) at times, but the presentation is well organized and well motivated. Also, his credentials are undisputable.Unfortunately, I think the applicable material in these books is starting to show its age. The discussions don't always apply to a world of huge system memories, fast-and-cheap CPUs, etc.With that said, reading these books and mastering the content would be a worthwhile accomplishment for any student of computer science. There are many footnotes to excellent papers. Even at over a thousand pages, Knuth does a good job showing you that these volumes are still just a starting point.
Anonymous More than 1 year ago
Anonymous More than 1 year ago
Anonymous More than 1 year ago
Anonymous More than 1 year ago
Anonymous More than 1 year ago
Unfortunately, I find I struggle with the mathematics more than I would like. Nevertheless, the effort you spend on these is rewarded. Be warned that this is definitely computer science material, and not a quickstart guide to your favorite programming language.
Guest More than 1 year ago
These three books are amazing. A deep, definitive coverage of the theoretical basis of computer science. In fact, to the extent that computer science is a science, you should refer to these books, if you are ever in doubt. As a measure of how well regarded these are, Knuth mentions in his home page that American Scientist magazine ranked this amongst the top 12 scientific monographs of the twentieth century, alongside books by Einstein, Dirac, Pauling and Feynman. Much of computer programming and usage today builds upon the algorithms described in the books. What does it mean to have a "good" random number generator? What are quantitative tests for randomness? How can you efficiently sort a list? How do you find the greatest common factor of two (large) positive integers? It is true that the typical computer programmer does not know most of the material in the books. This is because she usually can access subroutines that come with the language or are in standard libraries that implement the core algorithms. For example, in Java, there is a routine called Collections.sort(), which you call with the name of a list in the brackets, and the routine will sort it. But within the field of computer programming, sometimes you may be called upon to implement those core algorithms. So what do you do? Turn here for help. The books are also graced with a vital attribute. Each section of a chapter has a set of questions. Typically these are tough; they can keep you busy indeed. Plus, Knuth supplies the answers. The combination is a great learning experience. So often have I wondered at textbooks that don't supply questions. Students need hands on experience.
Guest More than 1 year ago
This is not a set for programmers-coders. This is a bible for Information Technology professionals with more scientific approach to matters. If you want to know what's really computer science basics about then read this whole set of books. If you prefer reading Java or Visual Basic books may be you need to mature to read this set from Knuth. This is a basic set of books for many Universities around the world. It has been for many years. If you are asked an interview question that is not some specific pattern related and coming from popular applications, but you get a question about efficiency and applicability of some sorting algorithm then they test you for your real knowledge of Computer Science - not what Java or .NET training you have had. Open your mind and read it if you did not graduate with MSCS yet. You will not regret, but some math can be difficult to some people without background.
Guest More than 1 year ago
This box set is very good for beginners. I recommend Schidlowsky and Sedgewick's 'Algorithms in Java' for a riotously good time. Plus, it¿s much cheaper!
Guest More than 1 year ago
Knuth gives an in-depth analysis of almost everything related to algorithms. There are mathematics in the book, but the casual reader can skip them and believe the author´s claims as justified in plain English, while the more theorical reader will understand better by following the rigorous proofs. Competent programmers who want to become masters should read this book; computer scientist must read this book, and anyone with a serious interest in the foundations of computer algorithms and programming can not find a more complete, entertaining and lasting reference. One word of warning: programming novices should wait -this book can be overkill, and it won´t help with everyday problems, nor teach you how to program. Also, if you just want to know the best algorithm for solving a given problem, or the latest trick in programming, you should read a more specific book.
Guest More than 1 year ago
This set of books is indispensable if you want to aspire to more than just writing Visual Basic programs. Browse through once in a while to pick up new tricks: new algorithms, new data structures - sometimes how just using a different number representation can make the difference between failure and success.