The Art of Computer Programming, Volume 2



The Art of Computer Programming, Volume 2

  • Title: The Art of Computer Programming, Volume 2
  • By: Donald E. Knuth
  • Format: eBook, 784 pages
  • ISBN: 0-201-89684-2 | 978-0-201-89684-8
  • Edition: Third (3rd)

The Art of Computer Programming, Volume 2

Seminumerical Algorithms

Overview

Volume 2 of Donald Knuth’s classic series The Art of Computer Programmingcovers seminumerical algorithms, with topics ranging from random number generators to floating point operations and other optimized arithmetic algorithms. Truly comprehensive and meticulously written, this book (and series) is that rarest of all creatures–a work of authoritative scholarship in classical computer science, but one that can be read and used profitably by virtually all working programmers.

The book begins with fundamental questions regarding random numbers and how to use algorithms to generate them. Subsequent chapters demonstrate efficient computation of single-precision and double-precision arithmetic calculations and modular arithmetic. The text then presents prime factorization (which can be used in cryptography, for instance) and algorithms for calculating fractions. This volume ends with algorithms for polynomial arithmetic and manipulation of power-series topics, which will benefit those with some knowledge of calculus.

Throughout this beautifully presented edition, Knuth incorporates hundreds of useful exercises for trying out the algorithms. These range from simple problems to larger research project topics. (The book provides answers, where appropriate, at the end of the book.) The result is a text that’s suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmer’s library.

Table of Contents

3. Random Numbers.

Introduction.
Generating Uniform Random Numbers.
The Linear Congruential Method.
Other Methods.
Statistical Tests.
General Test Procedures for Studying Random Data.
Empirical Tests.
Theoretical Tests.
The Spectral Test.
Other Types of Random Quantities.
Numerical Distributions.
Random Sampling and Shuffling.
What Is a Random Sequence?
Summary.

4. Arithmetic.

Positional Number Systems.
Floating Point Arithmetic.
Single-Precision Calculations.
Accuracy of Floating Point Arithmetic.
Double-Precision Calculations.
Distribution of Floating Point Numbers.
Multiple Precision Arithmetic.
The Classical Algorithms.
Modular Arithmetic.
How Fast Can We Multiply?
Radix Conversion.
Rational Arithmetic.
Fractions.
The Greatest Common Divisor.
Analysis of Euclid’s Algorithm.
Factoring into Primes.
Polynomial Arithmetic.
Division of Polynomials.
Factorization of Polynomials.
Evaluation of Powers.
Evaluation of Polynomials.
Manipulation of Power Series.

Answers to Exercises.

Appendix A. Tables of Numerical Quantities.

Fundamental Constants (decimal).
Fundamental Constants (octal).
Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B. Index to Notations.

Index and Glossary. 0201896842T03062003

Author Bios

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. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Backcover Copy

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

Download

To download an eBook version of The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Third Edition in PDF format for free please click the download link provided below.

Download

Like this book! You may buy a paperback edition of Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition)from Amazon to enrich your library collection.

Your rating:
1 Star2 Stars3 Stars4 Stars5 Stars (2 votes, average: 5.00 out of 5)

Loading ... Loading …





 

Comments

  1. can’t download file. bandwidth limit reach.

  2. The user hosting this content is out of bandwidth.

Speak Your Mind

*