Automotive Holiday Deals BOTYKT Shop Women's Dresses Learn more nav_sap_SWP_6M_fly_beacon Indie for the Holidays egg_2015 All-New Amazon Fire TV Get Ready for the Winter Gifts Under $100  Street Art Project Amazon Gift Card Offer aos aos aos  Amazon Echo Starting at $49.99 Kindle Voyage AntMan Shop Now BGG

Enter your mobile number or email address 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.

  • Apple
  • Android
  • Windows Phone
  • Android

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

Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition) 3rd Edition

4.8 out of 5 stars 14 customer reviews
ISBN-13: 078-5342896848
ISBN-10: 0201896842
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Sell yours for a Gift Card
We'll buy it for $13.09
Learn More
Trade in now
Have one to sell? Sell on Amazon

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Buy used On clicking this link, a new layer will be open
$38.95 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$59.48 On clicking this link, a new layer will be open
More Buying Choices
37 New from $44.47 29 Used from $22.19
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Best Books of the Year So Far
Looking for something great to read? Browse our editors' picks for 2015's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.
$59.48 FREE Shipping. In stock on December 13, 2015. Order it now. Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

  • Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition)
  • +
  • The Art of Computer Programming: Volume 3: Sorting and Searching (2nd Edition)
  • +
  • The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd Edition
Total price: $169.40
Buy the selected items together

NO_CONTENT_IN_FEATURE

Hero Quick Promo
Up to 85% Off Over 1,000 Kindle Books
Visit our Holiday Deals store and save up to 85% on more than 1,000 Kindle books. These deals are valid until December 31, 2015. Learn more

Product Details

  • Hardcover: 784 pages
  • Publisher: Addison-Wesley Professional; 3 edition (November 14, 1997)
  • Language: English
  • ISBN-10: 0201896842
  • ISBN-13: 978-0201896848
  • Product Dimensions: 6.4 x 1.8 x 9.3 inches
  • Shipping Weight: 2.8 pounds (View shipping rates and policies)
  • Average Customer Review: 4.8 out of 5 stars  See all reviews (14 customer reviews)
  • Amazon Best Sellers Rank: #192,540 in Books (See Top 100 in Books)

Customer Reviews

5 star
79%
4 star
21%
3 star
0%
2 star
0%
1 star
0%
See all 14 customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

8 of 8 people found the following review helpful By Vincent Poirier on August 9, 2006
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
Comment 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
18 of 21 people found the following review helpful By A Customer on April 3, 1998
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.
Comment 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
13 of 15 people found the following review helpful By Henrik Sandin on October 7, 1997
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 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
4 of 4 people found the following review helpful By A Customer on March 5, 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 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
10 of 13 people found the following review helpful By A Customer on April 1, 1998
Format: Hardcover
Knuth's presentation is obscure and difficult, but he's awfully comprehensive. If you want to learn algorithms, or even if you're looking for a reference, there are many better choices (especially Introduction to Algorithms, the CLR book). That said, I can't point to a more thorough book. Among other things, The Art of Computer Programming series is a great source of problems if you're teaching, learning, or just looking for fun. It might be worth the price just for that.
Comment 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
8 of 11 people found the following review helpful By A Customer on March 25, 1998
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.
Comment 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
1 of 1 people found the following review helpful By aj on November 11, 2013
Format: Hardcover Verified Purchase
It is simply excellent. Also, the paper and print quality are excellent. Commenting on the paper may sound trivial, but I just received an expensive textbook that looks like a fourth-generation photocopy.
Comment 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



Want to discover more products? Check out these pages to see more: art of programming, computer art