Warren Henry Hacker`s Delight 9780321842688

Варианты приобретения

Цена: 55590.00T
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Англия: 1 шт.
При оформлении заказа до: 2025-09-01
Ориентировочная дата поставки: конец Сентября - начало Октября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Warren Henry
Название: Hacker`s Delight
Перевод названия: Генри Уоррен: Победа хакера
ISBN: 9780321842688
Издательство: Pearson Education
Издательство: Addison-Wesley Professional
Классификация:

Компьютерное мошенничество и хакерство

ISBN-10: 0321842685
Обложка/Формат: Hardback
Страницы: 512
Вес: 0.86 кг.
Дата издания: 25.09.2012
Язык: English
Издание: 2 revised edition
Иллюстрации: Illustrations
Размер: 171 x 239 x 32
Читательская аудитория: Professional & vocational
Рейтинг:
Поставляется из: Англии
Описание: 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.

--Josh Bloch (Praise for the first edition)

In Hackers Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warrens hacks are eminently practical, but theyre also intrinsically interesting, and sometimes unexpected, much like the solution to a great puzzle. They are, in a word, a delight to any programmer who is excited by the opportunity to improve.

Extensive additions in this edition include

A new chapter on cyclic redundancy checking (CRC), including routines for the commonly used CRC-32 code
A new chapter on error correcting codes (ECC), including routines for the Hamming code
More coverage of integer division by constants, including methods using only shifts and adds
Computing remainders without computing a quotient
More coverage of population count and counting leading zeros
Array population count
New algorithms for compress and expand
An LRU algorithm
Floating-point to/from integer conversions
Approximate floating-point reciprocal square root routine
A gallery of graphs of discrete functions
Now with exercises and answers

Hacker`s Delight, Warren Henry