909 viewsdata structure
0


If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :(a) Less than 1 (b) Less than n(c) Less than m(d) Less than n/2[expand title=”

Changed status to publish
9

Answer : A
Explanation:
Answer” ](a) Hashing is also a method of sorting key values in a database table in an efficient manner. [/expand]

Changed status to publish
error: Content is protected !!