Question
Data structures with this property may leverage layouts such as the Z-order curve and Eytzinger layout. For 10 points each:
[10h] Name this property. Bender et al. utilized streaming B-trees with this property in the initial implementation of the fractal tree index data structure.
ANSWER: cache-oblivious [reject “cache-unaware” or “cache-aware”]
[10m] Cache-oblivious algorithms seek to maximize the spatial and temporal forms of this property, without being tuned to specific cache parameters. CPUs are more likely to access recently accessed memory locations according to this property’s namesake principle.
ANSWER: locality [accept locality of reference or temporal locality or spatial locality or memory locality or data locality or branch locality or equidistant locality; accept principle of locality]
[10e] Cache-oblivious algorithms are often illustrated through algorithms for this operation. This operation may be computed using divide-and-conquer through block partitioning in the Strassen algorithm.
ANSWER: matrix multiplication [prompt on multiplication]
<DN, Other Science (Computer Science)>
Data
| Team | Opponent | Part 1 | Part 2 | Part 3 | Total |
|---|---|---|---|---|---|
| AMOGH QUIZ HACK? 英雄联盟 400 PPG 24 TUH | Mindgoblin of Little Hobbes | 0 | 10 | 10 | 20 |
Summary
| Tournament | Edition | Exact Match? | Heard | PPB | Easy % | Medium % | Hard % |
|---|---|---|---|---|---|---|---|
| 2024 Chicago Open | 07/28/2024 | Y | 1 | 20.00 | 100% | 100% | 0% |