To determine which elements will create a collision in the hash table, we need to compute the hash function for each data element. The hash function given is: H(I) = (Data element) mod (Hash Table Size).
1. Calculate hash values for each element:
- 7: \(7 \mod 7 = 0\)
- 5: \(5 \mod 7 = 5\)
- 17: \(17 \mod 7 = 3\)
- 13: \(13 \mod 7 = 6\)
- 9: \(9 \mod 7 = 2\)
- 27: \(27 \mod 7 = 6\)
- 31: \(31 \mod 7 = 3\)
- 25: \(25 \mod 7 = 4\)
- 35: \(35 \mod 7 = 0\)
2. Identify collisions:
- Element 27 causes a collision with 13 as both have hash index 6.
- Element 31 causes a collision with 17 as both have hash index 3.
- Element 35 causes a collision with 7 as both have hash index 0.
- There is no collision for element 25 as it has a unique hash index 4.
3. Conclusion:
The statements for elements causing collisions are:
- (A) Element 27 will create collision.
- (C) Element 35 will create collision.
- (D) Element 31 will create collision.
Therefore, the correct answer is: (A), (C), and (D) only.