Skip to content
MathsGenie logo
Open app

Course home

x

Keys, values, and fast lookup

Keys, values, and fast lookup

Hash table schematic showing keys ALICE, BOB, and CAROL entering a hash function, with ALICE in slot 2, BOB in slot 5, and CAROL moved from colliding slot 2 to slot 3 by linear probing A hash table stores key-value pairs in an array so a program can find data quickly from a key such as a username or student ID. The key identifies the item, and the value is the data linked to that key.

Hash tables Lesson

  1. A Level
  2. /Computer Science
  3. /Hash tables

Step-by-step lessons covering AQA A Level Computer Science Hash tables for A Level Computer Science. Each lesson works through exam-style questions.

Lessons