benchmarks.wiki / Public workspace

MMLU-Pro / 10621 / An internal hash table has 5 buckets, numbered 0, 1, 2, 3, 4. Keys are integers,…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

An internal hash table has 5 buckets, numbered 0, 1, 2, 3, 4. Keys are integers, and the hash function h(i) = i mod 5 is used, with linear resolution of collisions (i.e., if bucket h(i) is filled, the buckets h(i) + 1, h(i) + 2, ... are tried successively with all bucket numbers computed modulo 5). If elements with keys 13, 8, 24, 10, and 3 are inserted, m that order, into an initially blank hash table, then the content of the bucket numbered 2 is

category

computer science

options

  1. 10
  2. 8
  3. 10 and 24
  4. Empty
  5. 24
  6. 3
  7. 10 and 3
  8. 3 and 8
  9. 13
  10. 13 and 8

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import