Hash Functions and Chaining
Direct addressing versus hashing; the load factor; division and multiplication hash functions with worked values and the reason to avoid powers of two; universal hashing; the simple uniform hashing assumption; separate chaining with its insert, search and delete costs, expected comparisons for successful and unsuccessful search and the worst case; the solved GATE CS 2026 Set 2 Q.30 drawn as a chained table; collision probabilities, expected empty slots and colliding pairs; chaining compared with open addressing.
