Mastering Java: The Ultimate Quiz for 'Thinking in Java'

Why is prime number selection important in hashing?

1. To minimize collisions

2. To make the algorithm faster

3. To secure the hashed data

4. To use memory efficiently

The correct answer is: To minimize collisions

Prime number selection is important in hashing because it helps to minimize collisions. A collision occurs when two different inputs produce the same hash output. By using prime numbers, the possible number of collisions is reduced, which makes it easier to retrieve and store data efficiently. Option B is incorrect because prime number selection does not affect the speed of the algorithm. Option C is incorrect because prime numbers themselves do not add any additional security measures to the hashed data. Option D is incorrect because prime number selection does not directly affect memory usage.