Algorithms \ Hashing

Question

Comments

I think answer would be 3) It minimizes the number of collision.

is it correct? @Lord_Krishna

---

no answer key is available.. @rude

---

hashing has mainly two way to distribute the keys in hash table: open addressing and chaining but both has problem of collision so we come up with the solutions like linear hashing,double hashing etc.

No. of collision depends on the choice of hash function. As there are different ways to choose hash function so ideal hash function will give minimum no. of collisions.

hence ans. should be (B)

Answer 1

Answer would be 3) It minimizes the number of collision, because The most important property of hash function is that it should uniformly distribute the keys so that less number of collision occurs. (Refer CLRS).

Now Comes to Other options.

1) It minimizes the rate of overflow: Overflow is not property of the hash function, I mean its a choice made by the programmer to choose the size of hash table. If No of keys > No of slots then there will be overflow but if No of keys < no of slot then there will be collision but not overflow.

2) It preserve the order of key value: No not at all. It does not preserve order of key. Its not at a characteristics or even a considerable point in hashing.

Answer 2

Hash functions compress a n (abritrarily) large number of bits into a small number of bits

Properties

• One way; can not be reversed
• Output does not reveal information on input
• Hard to find collisions (different messages with same hash)

Comments

@Shekhar dude do you understand what have you copied and pasted here.  http://www.dmst.aueb.gr/dds/secimp/crypto/hash.htm

Do you understand it? Do not take it otherwise, copying and pasting will not help you.

---

What's wrong with the answer ? is it not correct ?

---

Someone needs the Answer i gave it .I gave it ,it is option B. I don't understand whats the deal.