FREE Delivery in the UK.
Only 3 left in stock (more on the way).
Dispatched from and sold by Amazon. Gift-wrap available.
Quantity:1
The Art of Computer Progr... has been added to your Basket
+ £2.80 UK delivery
Used: Very Good | Details
Sold by sales-de
Condition: Used: Very Good
Comment: dispatched today or following business day, expected latest delivery in UK within 10 days
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 3 images

The Art of Computer Programming: Volume 2: Seminumerical Algorithms: Seminumerical Algorithms v. 2 Hardcover – 4 Nov 1997

5.0 out of 5 stars 2 customer reviews

See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
"Please retry"
Hardcover
"Please retry"
£49.99
£31.99 £16.69
Note: This item is eligible for click and collect. Details
Pick up your parcel at a time and place that suits you.
  • Choose from over 13,000 locations across the UK
  • Prime members get unlimited deliveries at no additional cost
How to order to an Amazon Pickup Location?
  1. Find your preferred location and add it to your address book
  2. Dispatch to this address when you check out
Learn more
£49.99 FREE Delivery in the UK. Only 3 left in stock (more on the way). Dispatched from and sold by Amazon. Gift-wrap available.
click to open popover

Special Offers and Product Promotions


Frequently Bought Together

  • The Art of Computer Programming: Volume 2: Seminumerical Algorithms: Seminumerical Algorithms v. 2
  • +
  • The Art of Computer Programming: Fundamental Algorithms Volume. 1: Fundamental Algorithms v. 1
  • +
  • The Art of Computer Programming: Sorting and Searching Vol. 3: Sorting and Searching v. 3
Total price: £147.47
Buy the selected items together

Enter your mobile number below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone

To get the free app, enter your mobile phone number.



Product details

  • Hardcover: 784 pages
  • Publisher: Addison Wesley; 3 edition (4 Nov. 1997)
  • Language: English
  • ISBN-10: 0201896842
  • ISBN-13: 978-0201896848
  • Product Dimensions: 16.3 x 4.6 x 23.6 cm
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Bestsellers Rank: 987,722 in Books (See Top 100 in Books)
  • See Complete Table of Contents

Product Description

From the Back Cover

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

The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series.



About the Author

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.




Customer Reviews

5.0 out of 5 stars
5 star
2
4 star
0
3 star
0
2 star
0
1 star
0
See both customer reviews
Share your thoughts with other customers

Top Customer Reviews

By A Customer on 5 Mar. 1998
Format: Hardcover
Of course this is a classic programming text, but the book is fascinating from a mathematical point as well. The discussion of random number generation is worth the price alone. Also neat is the discussion of why numbers with lower initial digits are 'more common' in practice than those with higher initial digits, a topic I've never seen treated elsewhere.
Comment 3 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
This book offers a stringent treatment of random number generators and algorithms not found anywhere else. It is particularly valuable for those that deal with encryption and the analysis of cyphers. The exercises add admirably to the text. References to other books in the field are extensive. The book is written in a non-wordy, but still very readable style, making it accessible to serious computer scientists at all levels. A mathematical background is necessary.
Comment 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: HASH(0x9a928984) out of 5 stars 14 reviews
21 of 24 people found the following review helpful
HASH(0x998fe5dc) out of 5 stars Can we shave a constant off this running time? 3 April 1998
By A Customer - Published on Amazon.com
Format: Hardcover
To an ordinary computer scienist, an algorithm is polynomial-time. To Knuth, it takes 3*n^2 + 17*x + 5 steps on MIX, not counting the time required to display the output, but there might be a way to reduce the number of steps to 3*n^2 + 17*x + 4. For precision and rigor, the Art of Computer Programming books are hard to beat. But, at least for an undergraduate CS student like me, they are slow going. Their greatest value seems to be as a reference for mathematical ideas needed in analysis of algorithms: recurrence relations, combinatorial identities, etc. Like the Bible, the TAOCP books are good to have around even if you don't plan to read them.
8 of 8 people found the following review helpful
HASH(0x99901a2c) out of 5 stars Numbers: random generations and arithmetic 10 Aug. 2006
By Vincent Poirier - Published on Amazon.com
Format: Hardcover
Volume 2 of "The Art of Computer Programming" is about random numbers and also about relearning one of the three Rs from grade school, viz. arithmetic. Each topic gets one chapter.

When you generate random numbers in Excel, or VBA, or Perl, or C using functions packaged with the software, you are really using a deterministic algorithm that is not random at all; the results do however look random and so we call them "pseudorandom".

Chapter 3 contains four main sections. First a section devoted to the linear congruence method (Xn+1=(aXn + c) mod m) of generating a pseudorandom sequence; with subsections on how to choose good values for a, c, and m. Second we get a section about how to test sequences to find if they are acceptably random or not. Third we find a section on other methods, expanding on linear congruence. Finally in a particularly fascinating section, DK provides a rigorous definition of randomness.

I haven't looked much at chapter 4 yet, on arithmetic. In it Knuth covers positional arithmetic, floating point arithmetic, multiplication and division at the machine level, prime numbers and efficient ways of investigating the primeness of very large numbers.

Again, DK is thorough and methodical. Again this is not a for dummies book. Again it is about theorems, algorithms, mechanical processes, and timeless truths. Again the exercises are a fascinating blend of the practical (investigate the random generating functions on the computers in your office) to the mathematical (he asks readers to formally prove many of the theorems he cites). And yes, again Knuth uses MIX, that wonderfully archaic fictional 60s machine language. But that should not stop readers; I use Perl.

Vincent Poirier, Tokyo
13 of 15 people found the following review helpful
HASH(0x9990115c) out of 5 stars State of the art reference for computer scientists 7 Oct. 1997
By Henrik Sandin - Published on Amazon.com
Format: Hardcover
This book offers a stringent treatment of random number generators and algorithms not found anywhere else. It is particularly valuable for those that deal with encryption and the analysis of cyphers. The exercises add admirably to the text. References to other books in the field are extensive. The book is written in a non-wordy, but still very readable style, making it accessible to serious computer scientists at all levels. A mathematical background is necessary.
4 of 4 people found the following review helpful
HASH(0x99904c00) out of 5 stars Fascinating 5 Mar. 1998
By A Customer - Published on Amazon.com
Format: Hardcover
Of course this is a classic programming text, but the book is fascinating from a mathematical point as well. The discussion of random number generation is worth the price alone. Also neat is the discussion of why numbers with lower initial digits are 'more common' in practice than those with higher initial digits, a topic I've never seen treated elsewhere.
8 of 11 people found the following review helpful
HASH(0x99904aa4) out of 5 stars Well, it's Knuth 25 Mar. 1998
By A Customer - Published on Amazon.com
Format: Hardcover
These volumes are considered first-class references on the subject of computing and algorithms. And they are... but these aren't really books to read. Nobody has time for that. However, for those computer scientists that really are hard up for something to read one of those rainy nights, Knuth has a personal flair and humor that spills into his algorithm summaries and exercises that is unsurpassed, at least in the field of CS handbooks. An excellent source for solutions to commonly asked questions and problems.
Were these reviews helpful? Let us know


Feedback