Question

In 2021, Bender et al. proved that an optimal tradeoff curve for these data structures involves an exponential reduction in the number of wasted bits for each insertion. Ronald Rivest showed that the efficiency of partial-match retrieval algorithms based on these data structures is approximately equal to tree-search algorithms. David Karger introduced a method for resizing these data structures in which only a number of items equal to the (*) load factor must be swapped. (-5[1])A scheme named for cuckoos (10[1])that implements many of these data structures has worst-case constant lookup time. Python’s built-in (10[1])dict type implements this data structure. (-5[1])Linear (10[1])probing can be used to resolve collisions in these data structures. For 10 points, name these data structures that implement a one-way mapping to store key-value pairs. (10[1])■END■ (0[1])

ANSWER: hash tables [accept dictionaries until “dict” is read; accept hash maps]
<KJ, Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Skand ParvatikarASU->Stanford->ASU pipelinePaddington in Peru (2024)73-5
Dennis YangSocial credit go vroomOld and Young7810
Daniel MaMadmen and SpecialistsIn the Mood for Buzz9210
Alan Xiebingy academyThe cult of SGA98-5
Ali HamzehToyota Tundra Turbos — Twisting Truths - Tackling Trivia - Taming Titansshe limp on my waltz till i feel pathetique9910
Coby TranPaddington in Peru (2024)ASU->Stanford->ASU pipeline12610
Collin LeckThe cult of SGAbingy academy1270