TAOCP Vol 2: Seminumerical Algorithms
Volume 2: Seminumerical Algorithms. 884 solved, 498 verified, 890 total.
Volume 2: Seminumerical Algorithms
Exercise solutions for TAOCP Volume 2. 884 solved, 498 verified, 890 total.
| Section | Title | Solved | Verified | Total |
|---|---|---|---|---|
| 3.1 | Introduction | 23 | 13 | 23 |
| 3.2.1 | The Linear Congruential Method | 5 | 4 | 5 |
| 3.2.1.1 | Choice of Modulus | 14 | 10 | 14 |
| 3.2.1.2 | Choice of Multiplier | 14 | 9 | 14 |
| 3.2.1.3 | Potency | 8 | 7 | 8 |
| 3.2.2 | Other Methods | 36 | 23 | 36 |
| 3.3.1 | General Test Procedures for Studying Random Data | 25 | 17 | 25 |
| 3.3.2 | Empirical Tests | 35 | 23 | 39 |
| 3.3.3 | Theoretical Tests | 28 | 12 | 28 |
| 3.3.4 | The Spectral Test | 32 | 17 | 32 |
| 3.4.1 | Numerical Distributions | 33 | 15 | 33 |
| 3.4.2 | Random Sampling and Shuffling | 19 | 10 | 19 |
| 3.5 | What Is a Random Sequence? | 44 | 17 | 46 |
| 3.6 | Summary | 15 | 10 | 15 |
| 4.1 | Positional Number Systems | 34 | 16 | 34 |
| 4.2.1 | Single-Precision Calculations | 19 | 13 | 19 |
| 4.2.2 | Accuracy of Floating Point Arithmetic | 32 | 22 | 32 |
| 4.2.3 | Double-Precision Calculations | 6 | 3 | 6 |
| 4.2.4 | Distribution of Floating Point Numbers | 20 | 9 | 20 |
| 4.3.1 | The Classical Algorithms | 43 | 21 | 43 |
| 4.3.2 | Modular Arithmetic | 14 | 4 | 14 |
| 4.3.3 | How Fast Can We Multiply? | 19 | 7 | 19 |
| 4.4 | Radix Conversion | 19 | 11 | 19 |
| 4.5.1 | Fractions | 9 | 5 | 9 |
| 4.5.2 | The Greatest Common Divisor | 42 | 26 | 42 |
| 4.5.3 | Analysis of Euclid's Algorithm | 42 | 22 | 42 |
| 4.5.4 | Factoring into Primes | 46 | 28 | 46 |
| 4.6 | Polynomial Arithmetic | 5 | 4 | 5 |
| 4.6.1 | Division of Polynomials | 26 | 12 | 26 |
| 4.6.2 | Factorization of Polynomials | 40 | 29 | 40 |
| 4.6.3 | Evaluation of Powers | 35 | 14 | 35 |
| 4.6.4 | Evaluation of Polynomials | 74 | 45 | 74 |
| 4.7 | Manipulation of Power Series | 28 | 20 | 28 |
TAOCP 3.3.1: General Test Procedures for Studying Random Data
Section 3.3.1 exercises: 25/25 solved.