Seatwork HASH (Data Structure)

Define a data item having some data and key, based on which the search is to be conducted in a hash table

• Insert

• Delete

• Key

• Data Item

What is a hash table?

• A structure that maps values to keys

• A structure that maps keys to values

• A structure used for storage

• A structure used to implement stack and queue

________ is a data structure which stores data in an associative manner.  

• Storage

• Key-value pairs

• Hash Table

• Hash Table

What is a hash function?

• A function has allocated memory to keys

• A function that computes the location of the key in the array

• A function that creates an array

• A function that computes the location of the values in the array

Which of the following is not a technique to avoid a collision?

• Make the hash function appear random

• Use the chaining method

• Use uniform hashing

• Increasing hash table size

What is the load factor?

• Average array size

• Average key

• Average chain length

• Average hash table length

Give 4 distinct aspects of how hash table works: (You can choose multiple options)

• Storage

• Key-value pairs

• A hashing function

• Table operations

• A load operator

Once we have the key-value pair, we pass them to the hash table to store the data for later retrieval.

• Hash functions

• Storage

• Key

• Operation

What is simple uniform hashing?

• Every element has equal probability of hashing into any of the slots

• A weighted probabilistic method is used to hash elements into the slots

• Elements has Random probability of hashing into array slots

• Elements are hashed based on priority

Choose the 3 Basic Operations in hash table:

• Search 

• Insert 

• Update

• Delete