Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
More Buying Choices
Have one to sell? Sell yours here
Art of Computer Programming, Volume 2: Seminumerical Algorithms
 
See larger image
 

Art of Computer Programming, Volume 2: Seminumerical Algorithms [Hardcover]

Donald E. Knuth
3.4 out of 5 stars  See all reviews (5 customer reviews)
List Price: CDN$ 83.99
Price: CDN$ 66.61 & this item ships for FREE with Super Saver Shipping. Details
You Save: CDN$ 17.38 (21%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.ca. Gift-wrap available.
Only 2 left in stock--order soon (more on the way).
Want it delivered Tuesday, May 29? Choose One-Day Shipping at checkout.

Product Details


Product Description

From Amazon

Volume 2 of Donald Knuth's classic series The Art of Computer Programming covers 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.

Book Description

Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.

 

The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e

ISBN: 0321751043 


Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

 

Customer Reviews

5 Reviews
5 star:
 (2)
4 star:
 (1)
3 star:    (0)
2 star:
 (1)
1 star:
 (1)
 
 
 
 
 
Average Customer Review
3.4 out of 5 stars (5 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most helpful customer reviews

4.0 out of 5 stars Legendary book, Dec 22 1999
By 
Alen Lovrencic (Varazdin, Croatia) - See all my reviews
This review is from: Art of Computer Programming, Volume 2: Seminumerical Algorithms (Hardcover)
This book is the bible of coputer programming

It contains algorithms on pseudo-random sequences, algotithms on aritmetic operations on number, matrices ect.

The only drawback of this book is that all algprothms are writeen in MIX - some kind of assembler, that make them hard to read.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


5.0 out of 5 stars Fascinating, Mar 5 1998
By A Customer
This review is from: Art of Computer Programming, Volume 2: Seminumerical Algorithms (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.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


5.0 out of 5 stars State of the art reference for computer scientists, Oct 7 1997
By 
Henrik Sandin (Lidingö, Sweden) - See all my reviews
(REAL NAME)   
This review is from: Art of Computer Programming, Volume 2: Seminumerical Algorithms (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.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
Want to see more reviews on this item?
 Go to Amazon.com to see all 5 reviews  4.8 out of 5 stars 
 
 
Most recent customer reviews



Only search this product's reviews



Listmania!

Create a Listmania! list

Look for similar items by category


Look for similar items by subject


Feedback


Amazon.ca Privacy Statement Amazon.ca Shipping Information Amazon.ca Returns & Exchanges