Sign inSign in
ConceptSystems & CS

Linear probe hashing

An open-addressing probing scheme where slots are scanned sequentially to find an entry or an empty slot.
as Andy Pavlo defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Andy Pavlo

    Carnegie Mellon University · Undergraduate

    • 24:30Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)

Connections

7

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.