Question

Q 12 How many maximum collisions are possible in a hash function, when the hash table has n keys and size is k?
Ops: A O min(0,n+k)
B. O max(0.n-k)
C.min(, nk)
D.Omax(0,n+k)​

Answer 1

Answer:

c min(,nk) is the ans

Explanation:

hope it 'll help u

Answer 2

Option (c) : min(nk)

• When two keys in a hash table are hashed to the same index, a collision occurs. Because each slot in a hash table is meant to hold just one element, collisions are a concern.
• When two keys in a hash table are hashed to the same index, a collision occurs. Because each slot in a hash table is meant to hold just one element, collisions are a concern.
• It is trivial to reach a collision when using simple hash functions. Consider the scenario where the hash function h(text) adds up all the character codes in a text. For texts containing the same letters in a different order, it will generate the same hash value (collision), i.e. h('abc') == h('cab') == h('bca').
• A collision attack on a cryptographic hash in cryptography looks for two inputs that produce the same hash value, or a hash collision. In contrast, a preimage attack specifies the target hash value in advance. There are essentially two different collision assault types: traditional colliding assault

#SPJ2