Question
A programmer needs fast average-case dictionary operations, and the chosen structure has the property that collisions must be handled when keys map to the same position. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Hash Table
Explanation:
Hash Table fits because it supports fast average-case dictionary operations and collisions must be handled when keys map to the same position.
Both clues point to this choice.
Leave a Reply