Virtual Labs

1. Which of the following is a common use of a hash table?

a: Storing data using key-value associations Explanation

Explanation

b: Sorting data automatically Explanation

Explanation

c: Representing every possible key uniquely without collisions Explanation

Explanation

d: Storing data only in sequential order Explanation

Explanation

2. Which of the following is the correct representation of a hash table after performing the mentioned operations? Assume a table size of 5, direct placement for the given keys, and all values are initially 0.

Insert(25);
Insert(26);
Remove(25);
Insert(50);

a: [0,0,0,0,0] Explanation

Explanation

b: [25,26,0,0,0] Explanation

Explanation

c: [50,26,0,0,0] Explanation

Explanation

d: [25,50,0,0,0] Explanation

Explanation

3. If a hash table has

m

slots and stores

n

elements, which expression represents its load factor?

m/n

Explanation

n/m

Explanation

n+m

Explanation

n-m

Explanation

4. What is the main purpose of a hash function in a hash table?

a: To sort all keys. Explanation

Explanation

b: To determine an index associated with a key. Explanation

Explanation

c: To delete duplicate keys automatically. Explanation

Explanation

d: To guarantee that collisions never occur. Explanation

Explanation

5. If

h(k)=k\bmod 7

, which index is produced for key

24

2

Explanation

4

Explanation

3

Explanation

5

Explanation

6. Which of the following can cause the performance of a hash table to deteriorate?

a: A good distribution of keys Explanation

Explanation

b: A suitable load factor Explanation

Explanation

c: Excessive collisions Explanation

Explanation

d: An efficient hash function Explanation

Explanation

7. Which collision-resolution technique checks a sequence of table positions using a quadratic offset after a collision?

a: Separate chaining Explanation

Explanation

b: Linear probing Explanation

Explanation

c: Quadratic probing Explanation

Explanation

d: Sequential sorting Explanation

Explanation

8. Consider a hash table with

m

slots and

n

elements. If

n

increases while

m

remains fixed, what happens to the load factor

\alpha=n/m

a: It increases. Explanation

Explanation

b: It decreases. Explanation

Explanation

c: It becomes zero. Explanation

Explanation

d: It remains unchanged. Explanation

Explanation

9. Why does a hash table generally aim for a uniform distribution of keys across its indices?

a: To guarantee sorted traversal. Explanation

Explanation

b: To minimize the number of table slots. Explanation

Explanation

c: To reduce collisions and maintain efficient operations. Explanation

Explanation

d: To ensure that every key has a different length. Explanation

Explanation

Hash Tables