# 50+ Hash Tables with Linear Probing MCQs with FREE PDF

We have the best collection of Hash Tables with Linear Probing MCQs and answer with FREE PDF. These Hash Tables with Linear Probing MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Hash Tables with Linear Probing MCQs

#### 1. Which of the following is not a collision resolution strategy for open addressing?

a) Linear probing

c) Double hashing

d) Rehashing

a) True

b) False

a) F(i)= 1

b) F(i)=i

c) F(i)=i2

d) F(i)=i+1

a) Hashing

b) Clustering

c) Rehashing

d) Collision

#### 5. What is the hash function used in linear probing?

a) H(x)= key mod table size

b) H(x)= (key+ F(i2)) mod table size

c) H(x)= (key+ F(i)) mod table size

d) H(x)= X mod 17

Answer: H(x)= (key+ F(i)) mod table size

a) True

b) False

#### 7. Which of the following problems occur due to linear probing?

a) Primary collision

b) Secondary collision

c) Separate chaining

d) Extendible hashing

a) 4 and 10

b) 2 and 6

c) 2.5 and 1.5

d) 3.5 and 1.5

a) 1

b) 0.5

c) 1.5

d) 0