A hash table of length 10 uses open addressing with hash function h(k)=k mod…

GATE · 2010 · CS · Computer Science & IT

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 is as shown below

Index

Key

0

1

2

42

3

23

4

34

5

52

6

46

7

33

8

9

How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above?

  1. A.

    10

  2. B.

    20

  3. C.

    30

  4. D.

    40

Attempted by 238 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…