Question

One form of this construct exhibits optimal performance with the impossible-to-implement Bélády’s algorithm. The valgrind utility is used to debug errors with this construct. Insufficient locality of this construct leads to thrashing, which involves pages of it constantly swapping. (10[1])Calling “free” twice can lead to (10[1])an incorrect access of this construct called a segfault. (10[1])Pointers (10[1])are so named for “pointing” to this construct. A form of this construct known as a cache (10[1])can be used to reduce the number of reads and writes to this construct’s “random-access” form. (10[1])For 10 points, (10[2])name this construct whose size (10[1])is measured in gigabytes. ■END■

ANSWER: computer memory [accept random-access memory or virtual memory; accept cache until read; prompt on RAM]
<Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Zachary BornsteinVirginia Tech BUNC D3810
John GambleNC StateAppalachian State A4410
Robert MerrimanVCUVirginia5310
Samuel MillerLiberty BUNC A5410
Koji BilbaoDuke AWilliam & Mary7110
Malachi LedfordTusculumAppalachian State B8710
Orion KellerVirginia Tech ALiberty C9010
Levan TsiskarishvilliJames Madison AJames Madison B9010
Soren HeydariUNC CDuke B9510

Summary

2024 ACF Fall at CornellfallY9100%0%33%71.22
2024 ACF Fall at Ohio StatefallY8100%0%13%66.75
2024 ACF Fall at WashingtonfallY6100%0%17%57.50
2024 ACF Fall at GeorgiafallY12100%0%25%69.17
2024 ACF Fall at North CarolinafallY9100%0%0%69.11
2024 ACF Fall at Claremont CollegesfallY5100%0%0%34.80
2024 ACF Fall at RutgersfallY8100%0%25%50.25
2024 ACF Fall at IllinoisfallY9100%0%44%67.44