We have the best collection of Hash Tables with Quadratic Probing MCQs and answer with FREE PDF. These Hash Tables with Quadratic 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 Quadratic Probing MCQs

**1. Which of the following is the correct function definition for quadratic probing?**

a) F(i)=i2

b) F(i)=i

c) F(i)=i+1

d) F(i)=i2+1

**Answer: **F(i)=i2

**2. How many constraints are to be met to successfully implement quadratic probing?**

a) 1

b) 2

c) 3

d) 4

**Answer: **2

**3. Which among the following is the best technique to handle collision?**

a) Quadratic probing

b) Linear probing

c) Double hashing

d) Separate chaining

**Answer: **Quadratic probing

**4. Which of the following techniques offer better cache performance?**

a) Quadratic probing

b) Linear probing

c) Double hashing

d) Rehashing

**Answer: **Linear probing

**5. What is the formula used in quadratic probing?**

a) Hash key = key mod table size

b) Hash key=(hash(x)+F(i)) mod table size

c) Hash key=(hash(x)+F(i2)) mod table size

d) H(x) = x mod 17

**Answer: **Hash key=(hash(x)+F(i2)) mod table size

**6. Which of the following schemes does quadratic probing come under?**

a) rehashing

b) extended hashing

c) separate chaining

d) open addressing

**Answer: **open addressing

**7. Quadratic probing overcomes primary collision.**

a) True

b) False

**Answer: **True

**8. What kind of deletion is implemented by hashing using open addressing?**

a) active deletion

b) standard deletion

c) lazy deletion

d) no deletion

**Answer: **lazy deletion