• Hash Tables: Theory, Implementation, and Universal Hashing

  • Feb 16 2025
  • Length: 16 mins
  • Podcast

Hash Tables: Theory, Implementation, and Universal Hashing

Listen for free

View show details

  • Summary

  • In this episode, we explore hash tables, a data structure designed for efficient insertion, deletion, and searching of data using keys. The document contrasts direct addressing with hashing, highlighting the space efficiency of hash tables when dealing with large key universes. It discusses collision resolution techniques like chaining and open addressing, exploring the trade-offs between them. Different hashing methods, including division and multiplication, are analyzed for their suitability in diverse contexts. We also introduce more advanced concepts like universal and adaptive hashing to optimize performance and handle dynamic data sets.


    Show more Show less
Show more Show less

What listeners say about Hash Tables: Theory, Implementation, and Universal Hashing

Average Customer Ratings

Reviews - Please select the tabs below to change the source of reviews.

Audible.ca reviews

Amazon Reviews
No reviews are available