The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table…

2026

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function:

h(k)=k mod 9

Collisions are resolved by chaining.

After all keys are inserted, the length of the longest chain is:

Attempted by 16 students.

Show answer & explanation

Correct answer: 3

Hash Table Chain Analysis

Given hash function: h(k) = k mod 9

Step 1: Calculate hash values for each key

  • 5 mod 9 = 5

  • 28 mod 9 = 1

  • 19 mod 9 = 1

  • 15 mod 9 = 6

  • 26 mod 9 = 8

  • 33 mod 9 = 6

  • 12 mod 9 = 3

  • 17 mod 9 = 8

  • 10 mod 9 = 1

Step 2: Build chains at each index

  • Index 0: (empty)

  • Index 1: 28 → 19 → 10 (length = 3)

  • Index 2: (empty)

  • Index 3: 12 (length = 1)

  • Index 4: (empty)

  • Index 5: 5 (length = 1)

  • Index 6: 15 → 33 (length = 2)

  • Index 7: (empty)

  • Index 8: 26 → 17 (length = 2)

Step 3: Find maximum chain length

The longest chain is at index 1 with length 3.

Answer: 3

Explore the full course: Gate Guidance By Sanchit Sir