| ||||||||||||
![]() Gutschein erhalten
Tauschen Sie jetzt The Art of Computer Programming 1. Fundamental Algorithms (Art of Computer Programming Volume 1) gegen einen Amazon-Gutschein in Höhe von EUR 13,75 ein - einlösbar für Tausende von Artikeln bei Amazon.de. Entdecken Sie mehr eintauschbare Bücher im Bücher Trade-In Shop. Bitte beachten Sie die Teilnahmebedingungen.
Jetzt für Amazon Student anmelden und um 20% erhöhten Eintauschwert sichern. |
Produktinformation
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
Ist der Verkauf dieses Produkts für Sie nicht akzeptabel? |
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.
Vorgeschlagene Tags zu ähnlichen Produkten(Was ist das?)Setzen Sie den ersten relevanten Tag hinzu (ein Schlüsselwort, das mit diesem Produkt in engem Zusammenhang steht).
|
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.
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.
I mean his definition of an "Algorithm" in chaper one couldn't be more obstuse and... Lesen Sie weiter...
|
Das Forum zu diesem Produkt
Fragen stellen, Meinungen austauschen, Einblicke gewinnen Aktive Diskussionen in ähnlichen Foren
Kundendiskussionen durchsuchen
|
Ähnliche Foren
|
||||||||||||||||||||||||||||||||||
|
|
|