DT Q2

0. A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is

  • Option : A
  • Explanation :
    If new record hashes onto one of the six locations 7, 8, 9, 10, 1 or 2, the location 2 will receive a new record. the probability is 6/10 (as 10 is total possible number of locations).
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *