HomeGroupsTalkZeitgeist
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

The Art of Computer Programming, Volume 2:…
Loading...

The Art of Computer Programming, Volume 2: Seminumerical Algorithms (1969)

by Donald Ervin Knuth

MembersReviewsPopularityAverage ratingMentions
711None13,408 (4.49)2
Recently added byspaetij, private library, jacobfwells, wuolong, prokizzle, ASMSALibrary, fariliang, rywang, etptupaf

None.

Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

» See also 2 mentions

Showing 2 of 2
I used this volume less than Fundamental Algorithms, and Sorting and Searching, but it still saved me hours and hours of work, more than once. ( )
  Lyndatrue | Jan 11, 2014 |
Difficult, instructive, intelligent, amusing and brain-numbing - all rolled-in-to-one in this classic of CS. Buy it, read a page at a sitting and savor it - this is a book read over 5 years. ( )
  appa | Dec 22, 2007 |
Showing 2 of 2
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Publisher series
Book description
Haiku summary

Amazon.com Amazon.com Review (ISBN 0201896842, Hardcover)

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.

(retrieved from Amazon Mon, 30 Sep 2013 13:27:27 -0400)

(see all 4 descriptions)

No library descriptions found.

Quick Links

Swap Ebooks Audio
70 wanted

Popular covers

Rating

Average: (4.49)
0.5
1
1.5
2
2.5
3 7
3.5
4 18
4.5 3
5 38

Is this you?

Become a LibraryThing Author.

 

Help/FAQs | About | Privacy/Terms | Blog | Contact | LibraryThing.com | APIs | WikiThing | Common Knowledge | Legacy Libraries | Early Reviewers | 89,448,508 books! | Top bar: Always visible