Cache-Oblivious Matrix Multiply Complexity - Quant Trader Interview Question
Difficulty: Hard
Category: Algorithms & Data Structures
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: algorithms, cache-oblivious, matrix multiplication, complexity analysis
Problem Description
A cache-oblivious algorithm is designed to perform optimally across various cache sizes without explicitly knowing the cache parameters (size $M$ and block size $B$). Consider a cache-oblivious matrix multiplication algorithm for multiplying two $n imes n$ matrices. What is the cache complexity (number of cache misses) of this algorithm?
Practice this hard trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.