Which data structure would be most efficient for implementing a cache with least recently used (LRU) eviction policy?
- Binary Search Tree
- Doubly Linked List
- Hash Table
- Priority Queue
A 'Doubly Linked List' is a common choice for implementing an LRU cache. It allows efficient insertion and removal of elements from both ends, making it suitable for the LRU policy.
Loading...
Related Quiz
- In deep learning, when the internal states of a neural network capture necessary information about previous time steps, it is particularly referred to as _______.
- What is the primary goal of penetration testing?
- A company is implementing a new ERP system. Midway through the project, they realize that the chosen software doesn't align with some of their core business processes. What should the company consider doing next?
- In cryptography, the process of disguising plaintext to hide its content is called _______.
- With the rise of digital channels, a retail company wants to enhance its customer experience. What strategic initiative should they prioritize to achieve a seamless omnichannel experience?