Expected cost of a mixed lookup workload
A hash table with separate chaining holds keys in buckets, spread uniformly. A successful lookup examines about entries on average and an unsuccessful lookup about entries, where is the load factor. In a workload where of lookups are for absent keys (unsuccessful) and hit a present key (successful), what is the expected number of entries examined per lookup?
Show hints (2)+
- First ; then unsuccessful costs , successful costs .
- Weight by the workload: , not a plain average.
Answer
Reveal answer →Final answer
3.75
Want the full step-by-step worked solution? It's part of Premium - along with a worked solution for every question in the bank.
Asked at: Multi-Strategy Quant, Data-Driven Research