GATEverse Practice, past papers & mock tests
GATE 2015 · Set-1
Programming & Data StructuresHashinghardMCQ2 marks
A hash table of length 10 uses open addressing with hash function h(k) = k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table slots contain: index 2: 42, index 3: 23, index 4: 34, index 5: 52, index 6: 46, index 7: 33. How many different insertion sequences of the key values using the same hash function and linear probing will result in this hash table?
Save your progress

Related Programming & Data Structures PYQs