Welcome to Programming and Data Structures

A collision-resolution strategy where all items are stored directly in the hash table array by probing for another open cell.

A contiguous run of occupied cells in a hash table that can increase probe lengths and reduce performance.

The event where two different keys map to the same hash table location.

A bitwise operation that returns 1 when two bits differ and 0 when they are the same.

The fixed-size value produced by a hash function for a given input.

A function that transforms input data into an integer or fixed-size value used for indexing or lookup.

A data structure that stores items in an array using hash values to choose locations.

The process of applying a hash function to convert data into hash values.

A probing strategy that checks the next cell, then the next, in sequence to resolve collisions.

The ratio of stored items to available table cells, often used to judge when resizing is needed.

See closed hashing.

A collision-resolution strategy that stores collections of items at each table index rather than forcing one item per cell.

A hash technique that updates the hash value efficiently when a window of input moves by one position.

See open hashing.

Short name for exclusive or, commonly used to combine bit patterns in hash computations.