hashing

What is the hash function used in the division method?

• h(k) = k/m

• h(k) = k mod m

• h(k) = m/k

• h(k) = m mod k

What is the primary purpose of a hash function in data structures?

• To encrypt data

• To store data in a sorted manner

• To map data to a fixed size

• To compress data

Which of the following is a common collision resolution technique in hashing?

• Chaining

• Sorting

• Binary Search

• Linear Regression

In the context of hash tables, what does 'load factor' refer to?

• The ratio of stored elements to the total capacity

• The number of collisions that occur

• The time complexity of insertions

• The maximum number of elements allowed

Which of the following best describes a hash table?

• A data structure that uses key-value pairs

• A linear data structure

• A type of tree structure

• A method for sorting data

Which of the following is NOT a characteristic of a good hash function?

• Deterministic output

• Uniform distribution of hash values

• Easy to compute

• Produces the same output for different inputs

What is a common drawback of using a hash table?

• It requires a large amount of memory

• It cannot handle dynamic data

• It has a fixed size

• It is slower than linked lists

Which of the following is a method to improve the performance of a hash table?

• Increasing the size of the table

• Using a more complex hash function

• Reducing the number of keys

• Storing data in a binary tree

What happens when two keys hash to the same index in a hash table?

• The first key is overwritten

• A collision occurs

• The table expands automatically

• The keys are stored in a sorted order

What is the time complexity of searching for an element in a hash table on average?

• O(1)

• O(n)

• O(log n)

• O(n log n)