100%(1)100% menganggap dokumen ini bermanfaat (1 suara)
1K tayangan307 halaman
If h is any hashing function and is used to hash n keys in to a table of size m, the expected number of collisions involving a particular key x is : (A) less than 1. (C) less than m. (B) less than 2. (D) less than 2.
If h is any hashing function and is used to hash n keys in to a table of size m, the expected number of collisions involving a particular key x is : (A) less than 1. (C) less than m. (B) les…