Data Structures - Hash Tables

What is the primary purpose of using a hash table in computing?

• To create a visual representation of data

• To store data in a way that allows for fast retrieval and insertion

• To increase the complexity of data algorithms

• To reduce the storage space needed for data

What is a collision in the context of hash tables?

• The physical damage to the storage device

• The loss of data due to power failure

• When two keys hash to the same index

• When a hash table reaches its maximum capacity

Which of the following is NOT a method to handle collisions in a hash table?

• Rehashing

• Linear probing

• Quadratic probing

• Data compression

What is the main use of a dictionary in programming?

• To check the spelling of words in a program

• To store data pairs in a key-value format

• To translate one programming language to another

• To store large amounts of text data

What is the primary advantage of using a hash table for data storage?

• It requires less memory.

• It allows sequential access to data.

• It can find any record almost instantly, regardless of dataset size.

• It is easier to implement than other data structures.

How is the address of a data item determined in a hash table?

• By the order of insertion.

• Using a hashing algorithm based on the data itself.

• Through manual assignment.

• By the size of the data item.

What is the primary purpose of using a hashing algorithm in data organization?

• To delete data from large datasets

• To encrypt data

• To assign a unique address to each record

• To duplicate data records

What is the name of the data structure that results from using a hashing algorithm?

• Binary tree

• Hash table

• Array

• Linked list

Which part of the record is typically used by a hashing algorithm to map the record to a unique destination address?

• The secondary key

• The record's timestamp

• The primary key

• The record's value

What is a potential problem with using a simple hashing algorithm as described?

• It does not allow for keys longer than 4 digits.

• It can lead to collisions where multiple keys have the same address.

• It requires too much computational power.

• It cannot handle more than 1000 keys.