Hash table

Term

Jump to a topic

See every item in the sequence

Definition

A structure that stores key and value pairs, using a hash function on the key to find the storage location, so lookups are very fast (a Python dictionary).

Example: Fast lookup: ages["Sam"].

Found in: syllabus.

Where you'll use it in the test

Syllabus area: Y11 Programming Fundamentals.

Question types it can appear in

Multiple choice: Pick the option that matches the definition or example.
Python: Write or complete it in the online Python tool.
Fill in the blanks: Choose this term to complete a statement or table.

How to use it

A model sentence

General advice, built from the definition and example above

“A structure that stores key and value pairs, using a hash function on the key to find the storage location, so lookups are very fast (a Python dictionary).” Then apply it: Fast lookup: ages["Sam"].

In a short answer, give the definition in your own words first, then tie it to the situation in the question. Do not copy the example above unless it fits the scenario.

Go deeper

Flashcard: Hash table in Programming Fundamentals (Year 11) · study that set
Memorise: Data structures
Notes: Data structures (Year 11 content (Programming fundamentals, OOP, Mechatronics))
Full term page: every question, note and marking comment for Hash table

Check yourself

Explain “Hash table” in one sentence, give an example, and name a question type that could test it.

Reveal the answer

A structure that stores key and value pairs, using a hash function on the key to find the storage location, so lookups are very fast (a Python dictionary).

Example: Fast lookup: ages["Sam"].

Could be tested as: Multiple choice, Python, Fill in the blanks.