[amp_mcq option1=”Hash table of next seen positions” option2=”Hash table of previously seen positions” option3=”Next value in the search” option4=”None of the mentioned” correct=”option1″]
The correct answer is: A. Hash table of next seen positions.
A transposition table is a data structure used in computer science to store the results of previous computations. It is a hash table that maps positions in the search space to the results of previous evaluations at those positions. This allows the search algorithm to avoid recomputing the same results multiple times.
The following are brief descriptions of each option:
- A. Hash table of next seen positions: This is the correct answer. A transposition table is a hash table that maps positions in the search space to the results of previous evaluations at those positions.
- B. Hash table of previously seen positions: This is not the correct answer. A transposition table is a hash table that maps positions in the search space to the results of previous evaluations at those positions, not to the positions themselves.
- C. Next value in the search: This is not the correct answer. A transposition table is not a data structure that stores the next value in the search. It stores the results of previous computations.
- D. None of the mentioned: This is not the correct answer. The correct answer is A.