A hash table of length 10 uses open addressing with hashfunction h(k)=k mod 10, and linear probing.
Fantastic news! We've Found the answer you've been seeking!
Question:
A hash table of length 10 uses open addressing with hashfunction h(k)=k mod 10, and linear probing. After inserting 6values into an empty hash table, the table is as shown below.
0 | |
1 | |
2 | 42 |
3 | 23 |
4 | 34 |
5 | 52 |
6 | 46 |
7 | 33 |
8 | |
9 |
Which one of the following choices gives a possible order inwhich the key values could have been inserted in the table?
- 46, 42, 34, 52, 23, 33
- 4, 42, 23, 52, 33, 46
- 46, 34, 42, 23, 52, 33
- 42, 46, 33, 23, 34, 52
Related Book For
Income Tax Fundamentals 2013
ISBN: 9781285586618
31st Edition
Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill
Posted Date: