The Art of Computer Programming
Autor Donald Knuthen Limba Engleză Hardback – 12 ian 2011
Observăm că ceea ce diferențiază The Art of Computer Programming de orice documentație tehnică oficială sau manual standard este profunzimea analizei și rigoarea matematică aplicată fiecărui algoritm. În timp ce documentația se limitează la sintaxă și utilizare, Donald Knuth construiește o bază teoretică solidă, transformând programarea într-o formă de artă fundamentată pe logică pură. Volumul 4A se concentrează pe căutarea combinatorie, un domeniu care a explodat în complexitate de la proiectarea inițială a seriei. Complementar setului The Art of Computer Programming, Volumes 1-3 Boxed Set, acest volum extinde analiza de la structurile clasice de date către generarea obiectelor combinatorii fundamentale, precum permutările și partițiile. Dacă volumele anterioare stabileau vocabularul de bază al informaticii, 4A plonjează în tehnici avansate de enumerare și optimizare. Structura cărții urmează o progresie logică riguroasă: începe cu o recapitulare a conceptelor matematice esențiale — de la inducție la funcții generatoare — și continuă cu o analiză detaliată a structurilor de informații, incluzând liste, cozi și reprezentări complexe de arbori. Suntem de părere că valoarea practică rezidă în cele 1500 de exerciții, care nu sunt simple teste, ci extensii ale teoriei, oferind soluții ce conțin adesea fapte inedite, indisponibile în alte publicații. Față de The Design and Analysis of Computer Algorithms, care oferă o introducere generală în structuri de date, lucrarea lui Knuth este mult mai densă, oferind implementări pas-cu-pas și o perspectivă istorică asupra fiecărui algoritm. Această abordare reflectă consecvența autorului, vizibilă și în Surreal Numbers, unde acesta demonstrează aceeași pasiune pentru eleganța sistemelor matematice complexe.
Preț: 463.13 lei
Preț vechi: 578.91 lei
-20%
Carte disponibilă
Livrare economică 08-22 mai
Livrare express 23-29 aprilie pentru 74.60 lei
Specificații
ISBN-10: 0201038048
Pagini: 912
Ilustrații: illustrations
Dimensiuni: 177 x 245 x 52 mm
Greutate: 1.49 kg
Ediția:1
Editura: Pearson Education
Locul publicării:Boston, United States
V-ar putea interesa
-
Still LifeSarah WinmanPreț: 92.64 lei -
-20%Preț: 107.31 lei134.14 lei -
The Library at Mount CharScott HawkinsPreț: 99.25 lei -
-28%Preț: 53.99 lei75.02 lei -
CompilersAlfred V. Aho-20%Preț: 643.20 lei804.01 lei -
Black Rabbit HallEve Chase-19%Preț: 56.32 lei69.47 lei -
A Carnival of Snackery: Diaries: Volume TwoDavid Sedaris-23%Preț: 78.48 lei101.38 lei -
-24%Preț: 43.19 lei56.91 lei -
PHP Beyond the WebRob Aley-20%Preț: 232.81 lei291.02 lei -
Java Lambdas and Parallel StreamsMichael Müller-20%Preț: 129.06 lei161.33 lei -
Building Trading Bots Using JavaShekhar Varshney-20%Preț: 459.66 lei574.58 lei -
C# and XML PrimerJonathan Hartwell-20%Preț: 198.62 lei248.27 lei -
Test Driven Development in RubyBala Paranj-20%Preț: 327.04 lei408.80 lei -
What You Can See From HereMariana Leky-27%Preț: 50.58 lei69.10 lei -
AlgorithmesDonald E. Knuth-20%Preț: 216.42 lei270.52 lei -
The Last Wild Trilogy: The Last Wild: Book 1Piers Torday-26%Preț: 46.03 lei62.49 lei -
Angular 2 CookbookMatt Frisbie-20%Preț: 302.93 lei378.67 lei -
The Art of DyingAmbrose ParryPreț: 69.66 lei -
The Last Wild Trilogy: The Dark Wild: Book 2Piers Torday-26%Preț: 46.30 lei62.64 lei -
The Last Wild Trilogy: The Wild Beyond: Book 3Piers Torday-26%Preț: 46.92 lei63.03 lei -
-20%Preț: 325.25 lei406.56 lei -
Axioms and HullsDonald E. Knuth-20%Preț: 313.15 lei391.44 lei -
MMIXwareDonald E. Knuth-20%Preț: 498.01 lei622.51 lei -
Programming Languages and SystemsHongseok Yang-20%Preț: 660.13 lei825.16 lei
De ce să citești această carte
Recomandăm acest volum programatorilor care doresc să depășească nivelul de utilizatori de biblioteci și să înțeleagă mecanica fundamentală a algoritmilor combinatorii. Cititorul câștigă acces la soluții optimizate pentru probleme de căutare și o metodologie de testare prin cele 1500 de exerciții. Este o investiție în fundamentul teoretic care rămâne valabil indiferent de schimbările limbajelor de programare.
Despre autor
Donald Knuth este considerat unul dintre părinții analizei algoritmilor, fiind profesor emerit la Universitatea Stanford. Lucrarea sa monumentală, The Art of Computer Programming, a definit standardele de rigoare în informatică. Knuth este cunoscut nu doar pentru contribuțiile sale teoretice, ci și pentru crearea sistemului de culegere digitală TeX și a limbajului Metafont, demonstrând o preocupare constantă pentru estetica și precizia prezentării informației tehnice. De-a lungul carierei, a primit numeroase distincții, inclusiv Premiul Turing, reflectând impactul său asupra întregului ecosistem IT modern.
Descriere scurtă
Knuth's multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth's analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems.
¿
The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient "review" of future volumes could almost be: "Knuth, Volume n has been published."
-Data Processing Digest
¿
Knuth, Volume n has been published, where n = 4A.
¿
In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams.
¿
The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form.
¿
There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages.
-Frank Ruskey, Department of Computer Science, University of Victoria
¿
The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer's library.
Notă biografică
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 (26 books, 161 papers). Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of his seminal multivolume series on classical computer science, begun in 1962 when he was a graduate student at California Institute of Technology. Professor Knuth is the recipient of numerous awards and honors, including the ACM Turing Award, the Medal of Science presented by President Carter, the AMS Steele Prize for expository writing, and, in November, 1996, the prestigious Kyoto Prize for advanced technology. He lives on the Stanford campus with his wife, Jill.
Cuprins
Preface
Notes on the Exercises
Chapter 7: Combinatorial Searching 1
7.1: Zeros and Ones 47
7.2: Generating All Possibilities 281
Answers to Exercises 514
Appendix A: Tables of Numerical Quantities 818
Appendix B: Index to Notations 822
Appendix C: Index to Algorithms and Theorems 828
Appendix D: Index to Combinatorial Problems 830
Index and Glossary 834
Textul de pe ultima copertă
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.
—Byte, September 1995
I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.
—Charles Long
If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.
—Bill Gates
It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.
—Jonathan Laventhol
This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures—the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.