hashing a level computer science

1234567891011
Across
  1. 2. Technique where an empty slot is found by checking the next available space (7 letters)
  2. 3. Technique used to handle hash collisions where multiple keys map to the same index (9 letters)
  3. 4. Another name for the array used to store hash table data maps(8 letters)
  4. 7. Hash tables often use a ___________ search to locate data quickly (7 letters)
  5. 8. The act of accessing data in a hash table using its key (9 letters)
  6. 10. The process used to convert a key into an index (8 letters)
  7. 11. Function that computes an index from a key in a hash table (11 letters)
Down
  1. 1. A key property of a hash function: producing the same output for the same input (13 letters)
  2. 5. Term for when a hash function maps two different keys to the same index (10 letters)
  3. 6. A good hash function should distribute keys ___________ across indices (evenly, 6 letters)
  4. 9. A data structure commonly used to implement hash tables, often made of arrays (5 letters)