Hacker's Delight

ISBN-10: 0201914654

ISBN-13: 9780201914658

Edition: 2003

Authors: Henry S. Warren

List price: $59.99
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description:

A collection useful programming advice the author has collected over the years; small algorithms that make the programmer's task easier. At long last, proven short-cuts to mastering difficult aspects of computer programming Learn to program at a more advanced level than is generally taught in schools and training courses, and much more advanced than can be learned through individual study/experience. An instant cult classic for programmers! Computer programmers are often referred to as hackers -- solitary problem solvers engrossed in a world of code as they seek elegant solutions to building better software. While many view these unique individuals as "madmen," the truth is that much of the computer programmer's job involves a healthy mix of arithmetic and logic. In Hacker's Delight, veteran programmer Hank Warren shares the collected wisdom -- namely tips and tricks -- from his considerable experience in the world of application development. The resulting work is an irresistible collection that will help even the most seasoned programmers better their craft. Henry S. Warren Jr. has had a 40-year career with IBM, spanning the computer field from the IBM 704 to PowerPC. He has worked on various military command and control systems, and on the SETL project under Jack Schwartz at NYU. Since 1973 he has been in IBM's Research Division at Yorktown Heights, New York. Here he has done compiler and computer architecture work on the 801 computer and its several variants through PowerPC. Presently he is working on the Blue Gene petaflop computer project. He received his Ph.D. in Computer Science from the Courant Institute at New York University in 1980.
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $59.99
Copyright year: 2003
Publisher: Addison Wesley Professional
Publication date: 7/17/2002
Binding: Hardcover
Pages: 320
Size: 6.50" wide x 9.25" long x 1.00" tall
Weight: 0.220
Language: English

Foreword
Preface
Introduction
Notation
Instruction Set and Execution Time Model
Basics
Manipulating Rightmost Bits
Addition Combined with Logical Operations
Inequalities among Logical and Arithmetic Expressions
Absolute Value Function
Sign Extension
Shift Right Signed from Unsigned
Sign Function
Three-Valued Compare Function
Transfer of Sign
Decoding a "Zero Means 2**n" Field
Comparison Predicates
Overflow Detection
Condition Code Result of Add, Subtract, and Multiply
Rotate Shifts
Double-Length Add/Subtract
Double-Length Shifts
Multibyte Add, Subtract, Absolute Value
Doz, Max, Min
Exchanging Registers
Alternating among Two or More Values
Power-of-2 Boundaries
Rounding Up/Down to a Multiple of a Known Power of 2
Rounding Up/Down to the Next Power of 2
Detecting a Power-of-2 Boundary Crossing
Arithmetic Bounds
Checking Bounds of Integers
Propagating Bounds through Add's and Subtract's
Propagating Bounds through Logical Operations
Counting Bits
Counting 1-Bits
Parity
Counting Leading 0's
Counting Trailing 0's
Searching Words
Find First 0-Byte
Find First String of 1-Bits of a Given Length
Rearranging Bits and Bytes
Reversing Bits and Bytes
Shuffling Bits
Transposing a Bit Matrix
Compress, or Generalized Extract
General Permutations, Sheep and Goats Operation
Rearrangements and Index Transformations
Multiplication
Multiword Multiplication
High-Order Half of 64-Bit Product
High-Order Product Signed from/to Unsigned
Multiplication by Constants
Integer Division
Preliminaries
Multiword Division
Unsigned Short Division from Signed Division
Unsigned Long Division
Integer Division by Constants
Signed Division by a Known Power of 2
Signed Remainder from Division by a Known Power of 2
Signed Division and Remainder by Non-Powers of 2
Signed Division by Divisors [greater than or equal] 2
Signed Division by Divisors [less than or equal] -2
Incorporation into a Compiler
Miscellaneous Topics
Unsigned Division
Unsigned Division by Divisors [greater than or equal] 1
Incorporation into a Compiler (Unsigned)
Miscellaneous Topics (Unsigned)
Applicability to Modulus and Floor Division
Similar Methods
Sample Magic Numbers
Exact Division by Constants
Test for Zero Remainder after Division by a Constant
Some Elementary Functions
Integer Square Root
Integer Cube Root
Integer Exponentiation
Integer Logarithm
Unusual Bases for Number Systems
Base-2
Base-1 + i
Other Bases
What Is the Most Efficient Base?
Gray Code
Gray Code
Incrementing a Gray-Coded Integer
Negabinary Gray Code
Brief History and Applications
Hilbert's Curve
A Recursive Algorithm for Generating the Hilbert Curve
Coordinates from Distance along the Hilbert Curve
Distance from Coordinates on the Hilbert Curve
Incrementing the Coordinates on the Hilbert Curve
Non-recursive Generating Algorithms
Other Space-Filling Curves
Applications
Floating-point
IEEE Format
Comparing Floating-Point Numbers Using Integer Operations
The Distribution of Leading Digits
Table of Miscellaneous Values
Formulas for Primes
Introduction
Willans's Formulas
Wormell's Formula
Formulas for Other Difficult Functions
Arithmetic Tables for a 4-Bit Machine
Newton's Method
Bibliography
Index
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×