Question

Efficient implementations of inverted memory paging use this data structure to store [emphasize] virtual page numbers. Protocols named for their similarity to this data structure, such as Kademlia and the Content Addressable Network, organized peer-to-peer systems by providing one “consistent” or “rendezvous” service. The birthday paradox gives an estimate of how early this data structure may need to apply resolution techniques like linear probing. (10[2])Assuming a low load factor, this data structure’s lookup and insertion procedures take “big-O of one” time on average, but worst-case performance may be linear-time (10[1])due to collisions. For 10 points, the Python dictionary type implements what data structure, which is named after functions that map keys to uniformly distributed array indices? ■END■ (0[1])

ANSWER: hash table [or hash map; prompt on dictionary until read; prompt on page table by asking “implemented as what data structure?”; reject “hash functions” or “hashes”]
<Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Richard NiuCornell CColumbia B6310
Ben SterlingYale ANYU A6310
Albert ZhangColumbia ARutgers A8810
Ethan FurmanHaverfordRowan A1160

Summary

2023 ACF Winter @ Columbia11/11/2023Y475%0%0%71.33