benchmarks.wiki / Public workspace

MMLU-Pro / 10449 / Hash tables can contribute to an efficient average-case solution for all of the…

Problem

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

question

Hash tables can contribute to an efficient average-case solution for all of the problems described below EXCEPT:

category

computer science

options

  1. Key comparison: Given two keys, determine if they are identical or different.
  2. Counting distinct values: Given a set of n keys, determine the number of distinct key values.
  3. Dynamic dictionary: Support the operations of insert, delete, and search in a dictionary.
  4. Range search: Given values a and b, find all the records whose key value is in the range a, b.
  5. Symbol table lookup: Given a program identifier, find its type and address.
  6. Frequency count: Given a set of n keys, determine how many times each key appears.
  7. Unique key identification: Given a key, find if it is unique in the set.
  8. Sequential search: Given a key value, find the first occurrence of the key in the set.

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