The Joys of Hashing - Mailund, Thomas; - Prospero Internet Bookshop

 
Product details:

ISBN13:9798868808258
ISBN10:88688082511
Binding:Paperback
No. of pages:218 pages
Size:235x155 mm
Language:English
Illustrations: 74 Illustrations, black & white
698
Category:

The Joys of Hashing

Hash Table Programming with C
 
Edition number: Second Edition
Publisher: Apress
Date of Publication:
Number of Volumes: 1 pieces, Book
 
Normal price:

Publisher's listprice:
EUR 53.49
Estimated price in HUF:
22 802 HUF (21 716 HUF + 5% VAT)
Why estimated?
 
Your price:

18 241 (17 373 HUF + 5% VAT )
discount is: 20% (approx 4 560 HUF off)
Discount is valid until: 31 December 2024
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
 
Availability:

Not yet published.
 
  Piece(s)

 
Short description:

Build working implementations of hash tables, written in the C programming language. The new and revised Second Edition has been enhanced with simplified code and more comprehensive explanations, aimed at improving clarity and comprehension while exploiting the latest features in C programming.



This book starts with simple first attempts devoid of collision resolution strategies. It then progresses through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. You will learn how hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. 



The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments.



What You Will Learn




  • Master the basic ideas behind hash tables

  • Carry out collision resolution, including strategies for handling collisions and their consequences for performance

  • Resize or grow and shrink tables as needed

  • Store values by handling when values must be stored with keys to make general sets and maps

Long description:

Build working implementations of hash tables, written in the C programming language. The new and revised Second Edition has been enhanced with simplified code and more comprehensive explanations, aimed at improving clarity and comprehension while exploiting the latest features in C programming.



This book starts with simple first attempts devoid of collision resolution strategies. It then progresses through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. You will learn how hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. 



The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments.



What You Will Learn




  • Master the basic ideas behind hash tables

  • Carry out collision resolution, including strategies for handling collisions and their consequences for performance

  • Resize or grow and shrink tables as needed

  • Store values by handling when values must be stored with keys to make general sets and maps



Who This Book Is For



Those with at least some prior programming experience, especially in C programming.

Table of Contents:
1. The Joys of Hashing.- 2. Hash Keys, Indices and Collisions.- 3. Collision Resolution, Load Factor and Performance.- 4. Resizing.- 5. Adding Application Keys and Values.- 6. Heuristic Hash Functions.- 7. Universal Hashing.- 8. Conclusions.