If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than _____
Answer is less than 1. Though it is not mentioned in the options tat r given. It is a scenario of Universal Hashing. Please kindly visit d link given below for more information.
http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap12.htm
Ans: A
ref: https://gateoverflow.in/45237/hashing
Gatecse
@Arjun sir, i haven't got my consignment. the ...
@Manish1
Nice to see your plenty ...
For those who knows only about ...