Question
A programmer needs bounded caching with temporal locality, and the chosen structure has the property that it is commonly implemented using a hash map plus a doubly linked list. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. LRU Cache
Explanation:
LRU Cache fits because it supports bounded caching with temporal locality and it is commonly implemented using a hash map plus a doubly linked list.
Both clues point to this choice.
Leave a Reply