Understanding Hash Tables (video)

What is the primary goal of using a hash table?

• To quickly find an item without comparing others

• To decrease the processing speed

• To sort data items

• To increase the memory usage

What does a hashing function determine?

• The speed of data retrieval

• The type of data stored

• The size of the hash table

• The position of an item in the hash table

What happens when a collision occurs in a hash table?

• An alternative position is found for one item

• Two items share the same position

• The item is deleted

• The table is resized

What is open addressing in hash tables?

• A way to calculate hash values

• A strategy to resolve collisions

• A method to encrypt data

• A technique to reduce table size

What is linear probing?

• A hashing function

• A way to decrease memory usage

• A data encryption method

• A collision resolution strategy

What is a disadvantage of linear probing?

• It cannot handle multiple collisions

• It is slower than chaining

• It can lead to clustering

• It uses more memory

How does chaining resolve collisions?

• By rehashing all items

• By resizing the hash table

• By placing colliding items in a linked list at the same position

• By deleting one of the colliding items

What is the effect of increasing the size of a hash table?

• Increases collisions

• Has no effect on collisions

• Decreases efficiency

• Reduces collisions

What is the purpose of an overflow table?

• To improve the hashing function efficiency

• To handle collisions by storing colliding items

• To store extra data not fitting in the main table

• To increase the main table size

What basic operations can be performed on a hash table?

• Encrypt, decrypt, and store

• Multiply, divide, and conquer

• Add, subtract, and multiply

• Add, delete, and retrieve a value