Define the following terms; hash table hash function perfect hash function What

Question

Define the following terms; hash table hash function perfect hash function What is the collision? Explain three ways of handling collisions (a program is not needed; a clear brief explanation suffices). Consider a hashing scheme that uses linear probing to resolve collisions. Design an algorithm (no code necessary) to delete an item from the hash table. What precautions do you need to take to make it work property?. Given the following data: 25-42-96-101 -102-162-197 Construct a hash table using the hash function, h(key) = key mod tablesize where the size of the table is 11. Use the rehash function, rh(key) = (key + 3) mod tablesize to resolve collisions. Construct a second hash table using the same hash function as above, but use chaining to resolve collisions

Explanation / Answer

1)define following terms

a)hash table:
       it is one type of datastructure which is used to implement arrays.this datastructure is
will map keys to values .this hash table will is also used in form of has function which is is used to
compute an index into slots where we can find required values

b)hash function :
       it is one type of fucntion which is used to connect or map data .here the hashfunction
will return values there are also called hash code.these hash function are used to detect duplicate data
.the functionality of hash function is it will assign data to the same values .this process is called collision .one of the application is finding dna sequence.

c)perfect hash function:it is one type of hash function which will have no collisions .this function will map data to the distinct elements.it is used to implement lookup tables

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.