Vor Ort
Merkzettel Warenkorb
Produktbild: The MMIX Supplement

The MMIX Supplement Supplement to the Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth

34,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

16.02.2015

Verlag

Pearson Academic

Seitenzahl

224

Maße (L/B/H)

24,1/16,1/1,7 cm

Gewicht

350 g

Sprache

Englisch

ISBN

978-0-13-399231-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

16.02.2015

Verlag

Pearson Academic

Seitenzahl

224

Maße (L/B/H)

24,1/16,1/1,7 cm

Gewicht

350 g

Sprache

Englisch

ISBN

978-0-13-399231-1

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
Die Leseprobe wird geladen.
  • Produktbild: The MMIX Supplement
  • 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 189