benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU / A program that checks spelling works in the following way. A hash table has been…

Problem

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

question

A program that checks spelling works in the following way. A hash table has been defined in which each entry is a Boolean variable initialized to false. A hash function has been applied to each word in the dictionary, and the appropriate entry in the hash table has been set to true. To check the spelling in a document, the hash function is applied to every word in the document, and the appropriate entry in the hash table is examined. Which of the following is (are) correct?
I. true means the word was in the dictionary.
II. false means the word was not in the dictionary.
III. Hash table size should increase with document size.

choices

  1. I only
  2. II only
  3. I and II only
  4. II and III only

subject

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

task_id
95322077-1b85-5191-b0e5-e39e391a61eb
task_key
all--test--95322077-1b85-5191-b0e5-e39e391a61eb
task_revision_id
1
config / split
all / test

Official source

initial import