Warehouse Stock Clearance Sale

Grab a bargain today!


Hacker's Delight
By

Rating

Product Description
Product Details

Table of Contents

  • Chapter 1: Introduction
  • Chapter 2: Basics
  • Chapter 3: Power-of-2 Boundaries
  • Chapter 4: Arithmetic Bounds
  • Chapter 5: Counting Bits
  • Chapter 6: Searching Words
  • Chapter 7: Rearranging Bits And Bytes
  • Chapter 8: Multiplication
  • Chapter 9: Integer Division
  • Chapter 10: Integer Division By Constants
  • Chapter 11: Some Elementary Functions
  • Chapter 12: Unusual Bases For Number Systems
  • Chapter 13: Gray Code
  • Chapter 14: Cyclic Redundancy Check
  • Chapter 15: Error-Correcting Codes
  • Chapter 16: Hilbert's Curve
  • Chapter 17: Floating-Point
  • Chapter 18: Formulas For Primes
  • Answers To Exercises:
  • Appendix A: Arithmetic Tables For A 4-Bit Machine
  • Appendix B: Newton's Method
  • Appendix C: A Gallery Of Graphs Of Discrete Functions

About the Author

Henry S. Warren, Jr., has had a fifty-year career with IBM, spanning from the IBM 704 to the PowerPC and beyond. He has worked on various military command and control systems and on the SETL (SET Language) project under Jack Schwartz. Since 1973, Hank has been with IBM’s Research Division, focusing on compilers and computer architectures. He currently works on a supercomputer project aimed at an exaflop. Hank received his Ph.D. in computer science from the Courant Institute at New York University.

Reviews

“This is the first book that promises to tell the deep, dark secrets of computer arithmetic, and it delivers in spades. It contains every trick I knew plus many, many more. A godsend for library developers, compiler writers, and lovers of elegant hacks, it deserves a spot on your shelf right next to Knuth. In the ten years since the first edition came out, it’s been absolutely invaluable to my work at Sun and Google. I’m thrilled with all of the new material in the second edition.” — Joshua Bloch   “When I first saw the title, I figured that the book must be either a cookbook for breaking into computers (unlikely) or some sort of compendium of little programming tricks. It’s the latter, but it’s thorough, almost encyclopedic, in its coverage. The second edition covers two new major topics and expands the overall collection with dozens of additional little tricks, including one that I put to use right away in a binary search algorithm: computing the average of two integers without risking overflow. This hacker is indeed delighted!” — Guy Steele

Ask a Question About this Product More...
 
Look for similar items by category
This title is unavailable for purchase as none of our regular suppliers have stock available. If you are the publisher, author or distributor for this item, please visit this link.

Back to top