Angebote zu "Elegance" (61 Treffer)

Kategorien

Shops

Hyrican Elegance 6305 - Tower - 1 x Core i9 990...
5.212,47 € *
ggf. zzgl. Versand

Kurzinfo: Hyrican Elegance 6305 - Tower - 1 x Core i9 9900K / 3.6 GHz - RAM 32 GB - SSD 2 TB - NVMe, HDD 3 TB - GF RTX 2080 Ti - GigE - WLAN: 802.11b/g/n/ac - Win 10 Home 64-Bit - Monitor: keiner Gruppe Desktops & Server Hersteller Hyrican Hersteller Art. Nr. PCK06305 Modell Elegance 6305 EAN/UPC 4045643063056 Produktbeschreibung: Hyrican Elegance 6305 - Tower - Core i9 9900K 3.6 GHz - 32 GB - 5 TB Typ Personal-Computer - Tower Prozessor 1 x Intel Core i9 (9. Gen.) 9900K / 3.6 GHz (5 GHz) (8 Kerne) Wichtigste Prozessormerkmale Intel Turbo Boost Technology 2 Cache-Speicher 16 MB Cache pro Prozessor 16 MB RAM 32 GB DDR4 SDRAM Massenspeicher-Controller SATA (SATA 6Gb/s) Festplatte 1 x SSD 2 TB - PCI Express - M.2 - NVM Express (NVMe) Festplatte (zweite) 1 x 3 TB - Serial ATA Grafik-Controller NVIDIA GeForce RTX 2080 Ti Videospeicher 11 GB GDDR6 SDRAM Audioausgang 7.1 Channel Surround Netzwerk GigE, 802.11b/g/n, 802.11ac Bereitgestelltes Betriebssystem Windows 10 Home 64-Bit-Version Farbe Schwarz

Anbieter: JACOB Computer
Stand: 18.09.2020
Zum Angebot
Hyrican Elegance 6417 - Tower - Core i9 9900KF ...
2.863,59 € *
ggf. zzgl. Versand

Kurzinfo: Hyrican Elegance 6417 - Tower - Core i9 9900KF / 3.6 GHz - RAM 32 GB - SSD 2 TB, HDD 3 TB - GF RTX 2080 SUPER - GigE - WLAN: 802.11b/g/n/ac - Win 10 Home 64-Bit - Monitor: keiner Gruppe Desktops & Server Hersteller Hyrican Hersteller Art. Nr. PCK06417 Modell Elegance 6417 EAN/UPC 4045643064176 Produktbeschreibung: Hyrican Elegance 6417 - Tower - Core i9 9900KF 3.6 GHz - 32 GB - 5 TB Typ Personal-Computer - Tower Prozessor Intel Core i9 (9. Gen.) 9900KF / 3.6 GHz (5 GHz) (8 Kerne) Prozessorsockel LGA1151 Socket Wichtigste Prozessormerkmale Intel Turbo Boost Technology 2 Cache-Speicher 16 MB L3 Cache pro Prozessor 16 MB RAM 32 GB (installiert) / 64 GB (Max) - DDR4 SDRAM Festplatte 1 x SSD 2 TB - PCI Express - M.2 Festplatte (zweite) 1 x 3 TB - SATA 6Gb/s Optischer Speicher Kein optisches Laufwerk Grafik-Controller NVIDIA GeForce RTX 2080 SUPER Videospeicher 8 GB GDDR6 SDRAM Audioausgang 7.1 Channel Surround Netzwerk GigE, 802.11b/g/n, 802.11ac Bereitgestelltes Betriebssystem Windows

Anbieter: JACOB Computer
Stand: 18.09.2020
Zum Angebot
In Search of Elegance in the Theory and Practic...
74,99 € *
ggf. zzgl. Versand

In Search of Elegance in the Theory and Practice of Computation ab 74.99 € als Taschenbuch: Essays dedicated to Peter Buneman. Auflage 2013. Aus dem Bereich: Bücher, Ratgeber, Computer & Internet,

Anbieter: hugendubel
Stand: 18.09.2020
Zum Angebot
The Art of Computer Programming, Volumes 1-4
162,85 € *
ggf. zzgl. Versand

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 Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. 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 Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. If you think you're a really good programmer. read [Knuth's] Art of Computer Programming. You should definitely send me a résumé if you can read the whole thing. -Bill Gates Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. 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 In describing the new fourth volume, one reviewer listed the qualities that distinguish all of Knuth's work. [In sum:] 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. -Frank Ruskey These four books comprise what easily could be the most important set of information on any serious programmer's bookshelf. Product Description 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 Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. 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 Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. If you think you're a really good programmer. read [Knuth's] Art of Computer Programming. You should definitely send me a résumé if you can read the whole thing. -Bill Gates Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. 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 In describing the new fourth volume, one reviewer listed the qualities that distinguish all of Knuth's work. [In sum:] 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. -Frank Ruskey These four books comprise what easily could be the most important set of information on any serious programmer's bookshelf. Backcover This boxed set consists of the following four volumes: 0201896834 / 9780201896831 Art of Computer Programming, Volume 1: Fundamental Algorithms 0201896842 / 9780201896848 Art of Computer Programming, Volume 2: Seminumerical Algorithms 0201896850 / 9780201896855 Art of Computer Programming, Volume 3: Sorting and Searching 0201038048 / 9780201038040 Art of Computer Programming, Volume 4A: Combinatorial AlgorithmsThis boxed set consists of the following four volumes: 0201896834 / 9780201896831 Art of Computer Programming, Volume 1: Fundamental Algorithms 0201896842 / 9780201896848 Art of Computer Programming, Volume 2: Seminumerical Algorithms 0201896850 / 9780201896855 Art of Computer Programming, Volume 3: Sorting and Searching0201038048 / 9780201038040 Art of Computer Programming, Volume 4A: Combinatorial Algorithms

Anbieter: buecher
Stand: 18.09.2020
Zum Angebot
The Art of Computer Programming, Volumes 1-4
162,85 € *
ggf. zzgl. Versand

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 Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. 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 Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. If you think you're a really good programmer. read [Knuth's] Art of Computer Programming. You should definitely send me a résumé if you can read the whole thing. -Bill Gates Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. 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 In describing the new fourth volume, one reviewer listed the qualities that distinguish all of Knuth's work. [In sum:] 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. -Frank Ruskey These four books comprise what easily could be the most important set of information on any serious programmer's bookshelf. Product Description 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 Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. 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 Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. If you think you're a really good programmer. read [Knuth's] Art of Computer Programming. You should definitely send me a résumé if you can read the whole thing. -Bill Gates Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. 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 In describing the new fourth volume, one reviewer listed the qualities that distinguish all of Knuth's work. [In sum:] 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. -Frank Ruskey These four books comprise what easily could be the most important set of information on any serious programmer's bookshelf. Backcover This boxed set consists of the following four volumes: 0201896834 / 9780201896831 Art of Computer Programming, Volume 1: Fundamental Algorithms 0201896842 / 9780201896848 Art of Computer Programming, Volume 2: Seminumerical Algorithms 0201896850 / 9780201896855 Art of Computer Programming, Volume 3: Sorting and Searching 0201038048 / 9780201038040 Art of Computer Programming, Volume 4A: Combinatorial AlgorithmsThis boxed set consists of the following four volumes: 0201896834 / 9780201896831 Art of Computer Programming, Volume 1: Fundamental Algorithms 0201896842 / 9780201896848 Art of Computer Programming, Volume 2: Seminumerical Algorithms 0201896850 / 9780201896855 Art of Computer Programming, Volume 3: Sorting and Searching0201038048 / 9780201038040 Art of Computer Programming, Volume 4A: Combinatorial Algorithms

Anbieter: buecher
Stand: 18.09.2020
Zum Angebot
In Search of Elegance in the Theory and Practic...
74,99 € *
ggf. zzgl. Versand

In Search of Elegance in the Theory and Practice of Computation ab 74.99 € als pdf eBook: Essays dedicated to Peter Buneman. Aus dem Bereich: eBooks, Sachthemen & Ratgeber, Computer & Internet,

Anbieter: hugendubel
Stand: 18.09.2020
Zum Angebot
The MMIX Supplement
24,18 € *
ggf. zzgl. Versand

The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth’s Foreword: “I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at mmix.cs.hm.edu . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany. Product Description The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth’s Foreword: “I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at mmix.cs.hm.edu . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany. Foreword iii Preface v Style Guide viii Programming Techniques xii Chapter 1: Basic Concepts 1 1.3.3. Applications to Permutations 1 1.4.4. Input and Output 8 Chapter 2: Information Structures 15 2.1. Introduction 15 2.2.2. Sequential Allocation 17 2.2.3. Linked Allocation 18 2.2.4. Circular Lists 25 2.2.5. Doubly Linked Lists 27 2.2.6. Arrays and Orthogonal Lists 36 2.3.1. Traversing Binary Trees 37 2.3.2. Binary Tree Representation of Trees 39 2.3.3. Other Representations of Trees 43 2.3.5. Lists and Garbage Collection 44 2.5. Dynamic Storage Allocation 45 Chapter 3: Random Numbers 48 3.2.1.1. Choice of modulus 48 3.2.1.3. Potency 49 3.2.2. Other Methods 50 3.4.1. Numerical Distributions 51 3.6. Summary 52 Chapter 4: Arithmetic 53 4.1. Positional Number Systems 53 4.2.1. Single-Precision Calculations 53 4.2.2. Accuracy of Floating Point Arithmetic 58 4.2.3. Double-Precision Calculations 58 4.3.1. The Classical Algorithms 62 4.4. Radix Conversion 68 4.5.2. The Greatest Common Divisor 70 4.5.3. Analysis of Euclid’s Algorithm 71 4.5.4. Factoring into Primes 72 4.6.3. Evaluation of Powers 72 4.6.4. Evaluation of Polynomials 73 Chapter 5: Sorting 74 5.2. Internal Sorting 74 5.2.1. Sorting by Insertion 76 5.2.2. Sorting by Exchanging 81 5.2.3. Sorting by Selection 87 5.2.4. Sorting by Merging 89 5.2.5. Sorting by Distribution 93 5.3.1. Minimum-Comparison Sorting 94 5.5. Summary, History, and Bibliography 95 Chapter 6: Searching 97 6.1. Sequential Searching 97 6.2.1. Searching an Ordered Table 99 6.2.2. Binary Tree Searching 102 6.2.3. Balanced Trees 103 6.3. Digital Searching 106 6.4. Hashing 108 Answers to Exercises 117 1.3.2. The MMIX Assembly Language 117 1.3.3. Applications to Permutations 120 1.4.4. Input and Output 120 2.1. Introduction 122 2.2.2. Sequential Allocation 123 2.2.3. Linked Allocation 124 2.2.4. Circular Lists 128 2.2.5. Doubly Linked Lists 130 2.2.6. Arrays and Orthogonal Lists 132 2.3.1. Traversing Binary Trees 134 2.3.2. Binary Tree Representation of Trees 136 2.3.5. Lists and Garbage Collection 139 2.5. Dynamic Storage Allocation 140 3.2.1.1. Choice of modulus 147 3.2.1.3. Potency 148 3.2.2. Other Methods 148 3.4.1. Numerical Distributions 149 3.6. Summary 150 4.1. Positional Number Systems 150 4.2.1. Single-Precision Calculations 151 4.2.2. Accuracy of Floating Point Arithmetic 152 4.2.3. Double-Precision Calculations 153 4.3.1. The Classical Algorithms 156 4.4. Radix Conversion 158 4.5.2. The Greatest Common Divisor 160 4.5.3. Analysis of Euclid’s Algorithm 160 4.6.3. Evaluation of Powers 161 4.6.4. Evaluation of Polynomials 161 5. Sorting 162 5.2. Internal Sorting 162 5.2.1. Sorting by Insertion 165 5.2.2. Sorting by Exchanging 169 5.2.3. Sorting by Selection 174 5.2.4. Sorting by Merging 175 5.2.5. Sorting by Distribution 179 5.3.1. Minimum-Comparison Sorting 180 5.5. Summary, History, and Bibliography 183 6.1. Sequential Searching 183 6.2.1. Searching an Ordered Table 184 6.2.2. Binary Tree Searching 185 6.2.3. Balanced Trees 185 6.3. Digital Searching 185 6.4. Hashing 186 Acknowledgments 188 Index 189The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth "I encourage serious programmers everywhere to sharpen their skills by devouring this book.” -Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth's guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth's Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth's Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original-preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth's insights in modern environments, until his revised, "ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth's Foreword: "I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany.

Anbieter: buecher
Stand: 18.09.2020
Zum Angebot
The MMIX Supplement
24,18 € *
ggf. zzgl. Versand

The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth’s Foreword: “I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at mmix.cs.hm.edu . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany. Product Description The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth’s Foreword: “I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at mmix.cs.hm.edu . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany. Foreword iii Preface v Style Guide viii Programming Techniques xii Chapter 1: Basic Concepts 1 1.3.3. Applications to Permutations 1 1.4.4. Input and Output 8 Chapter 2: Information Structures 15 2.1. Introduction 15 2.2.2. Sequential Allocation 17 2.2.3. Linked Allocation 18 2.2.4. Circular Lists 25 2.2.5. Doubly Linked Lists 27 2.2.6. Arrays and Orthogonal Lists 36 2.3.1. Traversing Binary Trees 37 2.3.2. Binary Tree Representation of Trees 39 2.3.3. Other Representations of Trees 43 2.3.5. Lists and Garbage Collection 44 2.5. Dynamic Storage Allocation 45 Chapter 3: Random Numbers 48 3.2.1.1. Choice of modulus 48 3.2.1.3. Potency 49 3.2.2. Other Methods 50 3.4.1. Numerical Distributions 51 3.6. Summary 52 Chapter 4: Arithmetic 53 4.1. Positional Number Systems 53 4.2.1. Single-Precision Calculations 53 4.2.2. Accuracy of Floating Point Arithmetic 58 4.2.3. Double-Precision Calculations 58 4.3.1. The Classical Algorithms 62 4.4. Radix Conversion 68 4.5.2. The Greatest Common Divisor 70 4.5.3. Analysis of Euclid’s Algorithm 71 4.5.4. Factoring into Primes 72 4.6.3. Evaluation of Powers 72 4.6.4. Evaluation of Polynomials 73 Chapter 5: Sorting 74 5.2. Internal Sorting 74 5.2.1. Sorting by Insertion 76 5.2.2. Sorting by Exchanging 81 5.2.3. Sorting by Selection 87 5.2.4. Sorting by Merging 89 5.2.5. Sorting by Distribution 93 5.3.1. Minimum-Comparison Sorting 94 5.5. Summary, History, and Bibliography 95 Chapter 6: Searching 97 6.1. Sequential Searching 97 6.2.1. Searching an Ordered Table 99 6.2.2. Binary Tree Searching 102 6.2.3. Balanced Trees 103 6.3. Digital Searching 106 6.4. Hashing 108 Answers to Exercises 117 1.3.2. The MMIX Assembly Language 117 1.3.3. Applications to Permutations 120 1.4.4. Input and Output 120 2.1. Introduction 122 2.2.2. Sequential Allocation 123 2.2.3. Linked Allocation 124 2.2.4. Circular Lists 128 2.2.5. Doubly Linked Lists 130 2.2.6. Arrays and Orthogonal Lists 132 2.3.1. Traversing Binary Trees 134 2.3.2. Binary Tree Representation of Trees 136 2.3.5. Lists and Garbage Collection 139 2.5. Dynamic Storage Allocation 140 3.2.1.1. Choice of modulus 147 3.2.1.3. Potency 148 3.2.2. Other Methods 148 3.4.1. Numerical Distributions 149 3.6. Summary 150 4.1. Positional Number Systems 150 4.2.1. Single-Precision Calculations 151 4.2.2. Accuracy of Floating Point Arithmetic 152 4.2.3. Double-Precision Calculations 153 4.3.1. The Classical Algorithms 156 4.4. Radix Conversion 158 4.5.2. The Greatest Common Divisor 160 4.5.3. Analysis of Euclid’s Algorithm 160 4.6.3. Evaluation of Powers 161 4.6.4. Evaluation of Polynomials 161 5. Sorting 162 5.2. Internal Sorting 162 5.2.1. Sorting by Insertion 165 5.2.2. Sorting by Exchanging 169 5.2.3. Sorting by Selection 174 5.2.4. Sorting by Merging 175 5.2.5. Sorting by Distribution 179 5.3.1. Minimum-Comparison Sorting 180 5.5. Summary, History, and Bibliography 183 6.1. Sequential Searching 183 6.2.1. Searching an Ordered Table 184 6.2.2. Binary Tree Searching 185 6.2.3. Balanced Trees 185 6.3. Digital Searching 185 6.4. Hashing 186 Acknowledgments 188 Index 189The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth "I encourage serious programmers everywhere to sharpen their skills by devouring this book.” -Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth's guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth's Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth's Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original-preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth's insights in modern environments, until his revised, "ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth's Foreword: "I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany.

Anbieter: buecher
Stand: 18.09.2020
Zum Angebot
The Art of Computer Programming, Volume 4, Fasc...
26,42 € *
ggf. zzgl. Versand

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 1 This fascicle, enlivened by a wealth of Knuth's typically enjoyable examples, describes basic "broadword" operations and an important class of data structures that can make computer programs run dozens-even thousands-of times faster. The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises present original material that has never before been published. Simply put, this fascicle is a must-have for anybody who is faced with tough problems of a combinatorial flavor. It demonstrates how ordinary programmers can make use of powerful techniques that heretofore seemed to be available only to people who used specialized languages and software. It shows how ideas once thought to be "far out" are now ready to become a part of the programming mainstream. Product 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 Art of Computer Programming, Volume 4, Fascicle 1, The: Bitwise Tricks & Techniques; Binary Decision Diagrams: Bitwise Tricks & Techniques; Binary Decision Diagrams This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 1 This fascicle, enlivened by a wealth of Knuth's typically enjoyable examples, describes basic "broadword" operations and an important class of data structures that can make computer programs run dozens-even thousands-of times faster. The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises present original material that has never before been published. Simply put, this fascicle is a must-have for anybody who is faced with tough problems of a combinatorial flavor. It demonstrates how ordinary programmers can make use of powerful techniques that heretofore seemed to be available only to people who used specialized languages and software. It shows how ideas once thought to be "far out" are now ready to become a part of the programming mainstream. Backcover This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 1 This fascicle, enlivened by a wealth of Knuth's typically enjoyable examples, describes basic "broadword" operations and an important class of data structures that can make computer programs run dozens-even thousands-of times faster. The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises present original material that has never before been published. Simply put, this fascicle is a must-have for anybody who is faced with tough problems of a combinatorial flavor. It demonstrates how ordinary programmers can make use of powerful techniques that heretofore seemed to be available only to people who used specialized languages and software. It shows how ideas once thought to be "far out" are now ready to become a part of the programming mainstream. Chapter 7: Combinatorial Searching 1 7.1 Zeroes and Ones 1 7.1.1 Boolean Basics 1 7.1.2 Boolean Evaluation 1 7.1.3 Bitwise Tricks and Techniques 1 7.1.4 Binary Decision Diagrams 70 Answers to Exercises 149 Index and Glossary 244 This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.Volume 4, Fascicle 1This fascicle, enlivened by a wealth of Knuth's typically enjoyable examples, describes basic "broadword" operations and an important class of data structures that can make computer programs run dozens-even thousands-of times faster. The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises present original material that has never before been published. Simply put, this fascicle is a must-have for anybody who is faced with tough problems of a combinatorial flavor. It demonstrates how ordinary programmers can make use of powerful techniques that heretofore seemed to be available only to people who used specialized languages and software. It shows how ideas once thought to be "far out" are now ready to become a part of the programming mainstream.

Anbieter: buecher
Stand: 18.09.2020
Zum Angebot