The hash function h(k)= k mod m and linear probing are used to insert the keys...

  

Transcribed Image Text:

The hash function h(k)= k mod m and linear probing are used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a hash table of size = 7 having indices 0...6. The order of the hash codes in the array are given by A. 72, 11, 37, 38, 56, 98, 47 B. 98, 56, 37, 38, 72, 11, 48 C. 98, 11, 37, 38, 72, 56, 48 D. 11, 37, 48, 38, 72, 98, 56 E. 11, 38, 98, 37, 72, 48, 56 The hash function h(k)= k mod m and linear probing are used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a hash table of size = 7 having indices 0...6. The order of the hash codes in the array are given by A. 72, 11, 37, 38, 56, 98, 47 B. 98, 56, 37, 38, 72, 11, 48 C. 98, 11, 37, 38, 72, 56, 48 D. 11, 37, 48, 38, 72, 98, 56 E. 11, 38, 98, 37, 72, 48, 56

Answer rating: 100% (QA)

The image contains a question about inserting keys into a hash table using a hash function and linea... View the full answer