What is the primary use of a LRU (Least Recently Used) cache?
A. To maintain an ordered list of elements
B. To store large amounts of data
C. To manage a fixed-size cache with eviction
D. To implement a priority queue
Answer: Option C
A. To maintain an ordered list of elements
B. To store large amounts of data
C. To manage a fixed-size cache with eviction
D. To implement a priority queue
Answer: Option C
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion