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

b) Quadratic probing

c) Double hashing

d) Rehashing

Answer: Rehashing

**2. In linear probing, the cost of an unsuccessful search can be used to compute the average cost of a successful search.**

a) True

b) False

Answer: True

**3. Which of the following is the correct function definition for linear probing?**

a) F(i)= 1

b) F(i)=i

c) F(i)=i2

d) F(i)=i+1

Answer: F(i)=i

**4. ___________ is not a theoretical problem but actually occurs in real implementations of probing.**

a) Hashing

b) Clustering

c) Rehashing

d) Collision

Answer: Clustering

**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

**6. Hashing can be used in online spelling checkers.**

a) True

b) False

Answer: True

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

a) Primary collision

b) Secondary collision

c) Separate chaining

d) Extendible hashing

Answer: Primary collision

**8. How many probes are required on average for insertion and successful search?**

a) 4 and 10

b) 2 and 6

c) 2.5 and 1.5

d) 3.5 and 1.5

Answer: 2.5 and 1.5

**9. What is the load factor for an open addressing technique?**

a) 1

b) 0.5

c) 1.5

d) 0

Answer: 0.5