Virtual Labs

1. Which of the following is the standard quadratic probing function definition?

F(i)=1

Explanation

F(i)=i

Explanation

F(i)=i^2

Explanation

F(i)=i+1

Explanation

2. Quadratic probing belongs to which of the following collision-resolution schemes?

a: Rehashing Explanation

Explanation

b: Extended hashing Explanation

Explanation

c: Separate chaining Explanation

Explanation

d: Open addressing Explanation

Explanation

3. What happens in quadratic probing when the initial hash position is occupied?

a: The key is discarded immediately. Explanation

Explanation

b: The hash table is sorted. Explanation

Explanation

c: Alternative positions are checked using quadratic offsets. Explanation

Explanation

d: A linked list is always created. Explanation

Explanation

4. Which expression represents a common quadratic probing sequence?

h(k), h(k)+1, h(k)+2, h(k)+3

Explanation

h(k), h(k)+1^2, h(k)+2^2, h(k)+3^2

Explanation

h(k), h(k)+2, h(k)+4, h(k)+6

Explanation

h(k), h(k)-1, h(k)-2, h(k)-3

Explanation

5. What is one advantage of quadratic probing compared with linear probing?

a: It completely eliminates collisions. Explanation

Explanation

b: It can reduce primary clustering. Explanation

Explanation

c: It always uses linked lists. Explanation

Explanation

d: It guarantees

O(1)

worst-case search. Explanation

Explanation

6. If

h(k)=k\bmod11

and

k=24

, what is the initial hash index?

1

Explanation

2

Explanation

3

Explanation

4

Explanation

7. Suppose the initial position is

4

and the quadratic offset is

i^2

. Ignoring wraparound, which position is checked for

i=2

5

Explanation

6

Explanation

7

Explanation

8

Explanation

8. What is a limitation of quadratic probing?

a: It cannot be used for collision resolution. Explanation

Explanation

b: It always requires a linked list. Explanation

Explanation

c: Depending on the table size and probing parameters, it may not visit every table position. Explanation

Explanation

d: It always produces the same probe sequence for every key. Explanation

Explanation

9. Which statement best describes the clustering behavior of quadratic probing?

a: It generally avoids the primary clustering characteristic of linear probing. Explanation

Explanation

b: It guarantees that no two keys can collide. Explanation

Explanation

c: It converts the table into a sorted array. Explanation

Explanation

d: It requires every collision to be stored in a linked list. Explanation

Explanation

Hash Tables