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 (10[1])construct. Insufficient locality of this construct leads to thrashing, which involves pages of it constantly swapping. Calling “free” twice can lead to an incorrect access of this construct (10[1])called a segfault. (-5[1])Pointers are so named for “pointing” (10[2])to this construct. (10[1])A form of this construct known as a cache can be used to reduce the number of reads and writes to this construct’s “random-access” form. For 10 points, name this construct (10[1])whose size 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
Skand ParvatikarArizona State BUBC A2210
Anne FjeldAlbertaBoise State5010
Stefan Stealey-EuchnerArizona State AUW Pride53-5
Euan McCubbinUW ChastityUW Lust5910
Landon DavidsonUW GreedUW Sloth5910
Jack LiUW WrathUW Envy6210
Alex HestermannUW PrideArizona State A9310

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