- 3 Consider The Perfect Hash Scheme Given In Our Class Notes 02 Universal Pdf And The Current State Of The Hash Table 1 (26.04 KiB) Viewed 33 times
3. Consider the perfect hash scheme given in our class notes (02-universal.pdf), and the current state of the hash table
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
3. Consider the perfect hash scheme given in our class notes (02-universal.pdf), and the current state of the hash table
3. Consider the perfect hash scheme given in our class notes (02-universal.pdf), and the current state of the hash tables as below: Show the steps of the following operations (in the given order): Insert(49), Find(60), Find(61), Delete(52), Delete(75), Insert(52) Note: Recall that the general form of the hash function is given as H(k)=((ak+b) mod p) mod m. Here we set the primary hash function with parameters a=3,b=42,p=101 and m=9. The parameters of the secondary hash functions for each slot are given in the figure above, which use the same p=101.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!