CM CM Hier klicken Jetzt informieren Xmas Shop 2017 Cloud Drive Photos UHD TVs Mehr dazu Hier klicken Mehr dazu Mehr dazu Shop Kindle MusicUnlimited BundesligaLive wint17

am 15. August 1999
I read this book when I was a sophomore in high school and I thought it was excellent. Prior to reading the book, I had wanted for a long time to write a program to evaluate standard mathematical expressions. I had even tried once before, but I didn't know enough about what I was doing to be really successful. Somewhere in the second chapter in a discussion of lists, doubly-linked-lists, and binary trees, a good solution came to me, and I implemented it right after I finished reading the book. It worked very well. This book helped me to accomplish the major goal-project of my computer programming career so far, and I definately think it is worth reading for anyone wanting a really advanced understanding of fundamental algorithms. Now I know to many advanced means total [over]use of fully encapsulated C++ objects, which this book doesn't have, but this book gives an advanced understanding, which is infinitely more valuable than classes. If you understand OOP and you understand this book, you should be able to combine the two just fine. Lastly, I'd like to comment on the use of MIX. I read almost none of the MIX assembly code when I read this book. The little I looked at I looked at because I wanted to see what assembly was like in the 60's. But you can understand everything he's trying to say by his explanations of the algorithms, the assembly code is only for clarification, and you don't have to read it. I also believe that everyone who's been using fully encapsulated classes for their entire programming career should learn an assembly language sometime. Just like this book, it will teach you how to think.
0Kommentar| 4 Personen fanden diese Informationen hilfreich. War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 29. Januar 2003
Donald E. Knuth versteht es wie kein anderer, sich mathematisch mit einem Problem auseinanderzusetzen. Durch arithmetische Berechnungen nimmt er den Leser mit auf seine Reise durch die Welt der effizienten Algorithmen und seiner MIX-Architektur.
Jeder, der seine Mathematik-Kenntnisse auffrischen, seine Algorithmen verbessern und die Grundlagen von Assembler lernen möchte, dem empfehle ich dieses Buch. In jedem Fall hat man lange daran zu knabbern - Aber es lohnt sich. Müsste ich auf eine einsame Insel ziehen und dürfte nur ein Buch mitnehmen, käme Band 1 von Knuths TAoCP in die engere Auswahl.
0Kommentar| 3 Personen fanden diese Informationen hilfreich. War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 24. Juni 2000
Algorithms are useful to study because they come up frequently in the practice of programming, and thus I think that this book is most useful after or while you've dealt with actual programming. By then it is fairly obvious where the algorithms come from; they are merely attempts to solve problems.
So don't kill yourself if you're new to real programming and all this sounds arbitrary. Knuth in effect has written a clearinghouse of ideas that have come up in computer science. This book at times comes to seem like The Art of Explaining.
For those who hate the use of the MIX assembly language instead of some easier language such as C: You lose information that way. That is sufficient reason for not using C. You can't really time an algorithm using such a language (and a main reason for studying algorithms is speed) unless you carefully define the underlying hardware and C implementation... and once you do that, using C is pointless for pedagogy, since you will be using inline MIX for things that C is too general for.
And you'd really hate it if you were programming in Lisp.
There are quite a few good books on algorithms in C, though I haven't read them. If you're forced to read this book, consider changing your situation; Knuth has fallen on hard times if his text has become a torture device for some.
0Kommentar| 2 Personen fanden diese Informationen hilfreich. War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 8. Juni 2000
This was one of the first computer books I read 20 years ago (the selection in our office was limited). It remains one of the best in its field. There is just so much information in this series of books that you be hard pushed to ever to think of a fundamental computing problem that hasn't been covered. The books are more geared towards computer scientists than application programmers like myself but nevertheless are really worth reading. Modern high level languages do so much for you these days that it is easy to forget what is going on under the bonnet (or 'hood' for US readers) but even if you don't need to know the details, familiarity with the principles will greatly benefit your work.
There are a lot of programmers who can write code that works but don't have any great feel for what they are doing. The best programmers understand not only what they are doing but why they are doing it that way. These are the ones who deliver the best results and this series of books can place you firmly in this camp.
The only weakness of the book isits over reliance on the author's MIX language. Certainly there are reasons for him using it but it is still a barrier for many people.
0Kommentar| 2 Personen fanden diese Informationen hilfreich. War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 10. November 1997
Anyone who aspires to be a transcendent programmer must own (and use) Knuth. I've used my 20 year old TAOCP vol. 1 so many times over the years that it lays flat at any page.
The updated volume 1 is more of the same - a classic revisited, revamped, restored. It is odd to handle something so familiar, yet so crisp.
Those who dislike MIX will be unimpressed - to them, I say that you don't learn by doing the same vanilla thing time and again, but rather by wrestling with unfamiliar concepts and architectures. Many times my fellow programmers will find themselves roadblocked in an unfamiliar situation, while I often can see the unobvious solution - I attribute this ability to a wide experience with unconventional solutions, including extensive study of Knuth's TAOCP.
If you're serious about your programming abilities, you *must* own (and study) this book! Frankly, if computer science were taught as an apprenticeship, this would be the journeyman's manual. I've required the many programmers I've trained over the years to own and study TAOCP, and they've all come to appreciate it's layered approach to problems - you can read Knuth at many levels, from algorithm reference to meta-analysis of an entire class of problems.
If there is a Koran, Bible, or Tao of Computer Science, this is it. The only thing close is Aho's "Dragon Book," and it's specific to compilers.
0Kommentar| Eine Person fand diese Informationen hilfreich. War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 8. Oktober 1999
"So, let's get this straight -- Knuth's core work has been to write half of a series on algorithms, and one typesetting package, and he's famous??"
Deservedly so.
I can't wait for the rest of the books to come out. The plot's a little thin, character development could use some work, I really wasn't into the cliffhanger chapter endings, but these books are essential for anyone learning computer science.
There is no substitute.
0Kommentar| 2 Personen fanden diese Informationen hilfreich. War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 24. Oktober 1997
I believe very strongly in understanding what the computer is doing at the lowest levels, but Knuth's reliance on MIX is unforgivable. There needs to be a high level pseudocode version of the algorithm, and then the MIX version. Reading a 'summary' in high level and then the assembly level would add to my understanding immensely.
0Kommentar| 2 Personen fanden diese Informationen hilfreich. War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 6. Oktober 1997
As a `Technical Informatics' student, I had heard of the three (so far) volumes of Knuth. When I found out that new editions of the books were being published, I asked a teacher if it could be of any use to me. He said it was pretty heavy on the math, and if you don't have a feeling for math, the books are pretty tough. Now, I am not very good at mathematics, but when I went to a localbookstore where the new edition of volume 1 laid in stacks on a `just arrived' table, I picked up a copy and started reading somewhere in chapter 2. Suddenly a member of the bookstore's staff tapped me on the shoulder and asked me if I tried to read the whole thing right there. When I asked why, she told me I had been standing there for more than half an hour, completely absorbed by the book. Right there I concluded my teacher was wrong, and that if you've been programming for some time, this book can still teach you some very valuable lessons, even about `trivial' things like lists and stacks. When the other two volumes are published, they'll be right beside my copy of volume 1. A very impressive sight for friends who want to know what these beautifully bound books are about. In short, if you're a programmer, you get a copy of all the volumes of The Art of Computer Programming. I think it's a good step in becoming a computer programming artist.
0Kommentar|War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 29. November 1997
Knuth has finally updated the three completed volumes ofhis exceptional "The Art of Computer Programming" series,correcting errors and updating the topics to includestate-of-the-art algorithms while retaining the basicstrengths and weaknesses of the books. This comes as arelief to many old-time programmers who, watching Knuth's20-year diversion in pursuit of typographic perfection, hadbecome convinced he was NEVER going to get around tocompleting the remaining four volumes of the series.
The series's strength is its exhaustive survey and deepscientific analysis of the many algorithms applicable tothe areas of computer science covered. No other book orseries comes close in providing the reader with the toolsto understand and develop algorithms and to choose amongthe alternatives available when faced with a programmingchallenge requiring an algorithmic solution.
Knuth's primary weapon for analysis is mathematics and hedoesn't hesitate in beating algorithms to death with abarrage of equations; in fact, on a few pages a reader canfind up to thirty summation signs. So a warning is inorder: readers with math anxiety are likely to be reducedto a state of insensate palpitation. Yet the books containvery little calculus or other higher mathematics and thus acollege sophomore should be able to follow the discussion.Also, the reader can skip all the proofs on first readingand simply trust that Knuth is telling the truth.
Surprisingly, the series contains much background materialon the history of computer science and quite a bit of wryhumor. It is about as lively as can be expected of a seriesso deeply technical.
The series's greatest weakness is the MIX assemblylanguage, which Knuth uses to illustrate algorithms, almostalways after first describing them in English. Althoughassembly language is necessary in order to maintain Knuth'sdeconstructionist approach, MIX is deeply rooted in the1960s concept of a computer, with no stack orgeneral-purpose registers. Worse, a reader returning to thebook after letting it lie fallow will find the MIXinstruction mnemonics are needlessly cryptic (What do"ENNX" and "JBUS" mean!?). Perhaps Knuth will update theinstruction set or improve the mnemonics in a futureedition.
To sum up, I'd like to repeat some advice that was given tome in 1974 and is still true today: "If you want to be aprogramming technician, read about the latest programmingfad. If you want to be a computer scientist, read Knuth."
-- Glenn Fawcett
0Kommentar|War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden
am 4. Februar 2000
Well this book is a good and a complete book. Many of the readers who are veterans may want to read more about algorithms and data structures require this book.
The book is complete and well formed. As for the Mix code(assembly) it is his way of telling us how to integrate the algo. into our coding. You must have a lot of patiences and dedication in reading the book. This book is not for amateurs. They must have at least a firm understanding of assembly language prior to reading this book.
The reason I bought all the books is b'cos it saves a lot of money. Imagine that you buying data structures for each language. Still the books does not allow you to port over the data structures to other languages(c,c++,java,pascal,.....). It is a de facto in algo. and data structures. This book is a great reference.
Ps. don't buy it if you just want to use data structures and algo. quickly.
0Kommentar|War diese Rezension für Sie hilfreich?JaNeinMissbrauch melden