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 (10[1])to thrashing, (-5[1])which involves pages of it constantly swapping. Calling “free” twice can lead to an incorrect access of this construct (10[1])called (10[1])a segfault. Pointers (-5[1])are so named for “pointing” to this construct. (10[1]-5[1])A form of this construct known as a cache (10[1])can be used to reduce the number (10[1])of reads and writes to this construct’s “random-access” form. For 10 points, name this construct whose size is measured in gigabytes. ■END■ (10[3])

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

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

Buzzes

PlayerTeamOpponentBuzz PositionValue
Tom ScheriRIT AU of Rochester A2910
Will HooverRIT BPenn State31-5
Owen LinderBinghamton AESF5010
Aksel MalatakSyracuseBinghamton B5110
Brian HoffCornell BCornell E54-5
Elizabeth LarkinCornell FCornell C6210
Joseph TabaskoBinghamton CU of Rochester B62-5
Alec RisoCornell DCornell G7110
Grace GriffithsPenn StateRIT B7810
Anna KuangCornell ECornell B10010
Kritanu SahaCornell ARIT C10010
Sammy CarstensU of Rochester BBinghamton C10010