Advanced
Data Structures & Algorithms
Q88 / 100
What is the concept of cache-oblivious algorithms?
Correct! Well done.
Incorrect.
The correct answer is B) Algorithms achieving optimal cache usage for any memory hierarchy without knowledge of cache size or block size
B
Correct Answer
Algorithms achieving optimal cache usage for any memory hierarchy without knowledge of cache size or block size
Explanation
Cache-oblivious algorithms (Frigo et al.) use recursive divide-and-conquer that automatically adapts to any cache size. Examples: cache-oblivious sorting, matrix multiplication, and merge sort.
Progress
88/100