# Hash Tables with Quadratic Probing Multiple choice Questions and Answers (MCQs)

## Hash Tables with Quadratic Probing Multiple choice Questions and Answers (MCQs)

 Question 1
Which of the following schemes does quadratic probing come under?
 A rehashing B extended hashing C separate chaining D open addressing
English grammar Questions answers
Question 1 Explanation:
Quadratic probing comes under open addressing scheme to resolve collisions in hash tables.

 Question 2
Quadratic probing overcomes primary collision.
 A True B False
Question 2 Explanation:
Quadratic probing can overcome primary collision that occurs in linear probing but a secondary collision occurs in quadratic probing.

 Question 3
What kind of deletion is implemented by hashing using open addressing?
 A active deletion B standard deletion C lazy deletion D no deletion
Computer science Questions answers
Question 3 Explanation:
Standard deletion cannot be performed in an open addressing hash table, because the cells might have caused collision. Hence, the hash tables implement lazy deletion.

 Question 4
In quadratic probing, if the table size is prime, a new element cannot be inserted if the table is half full.
 A True B False
NTA NET Questions answers
Question 4 Explanation:
If quadratic probing is used and if the table size is prime, then, a new element can be inserted if the table is half empty.

 Question 5
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
Question 5 Explanation:
The function of quadratic probing is defined as F(i)=i2. The function of linear probing is defined as F(i)=i.

There are 5 questions to complete.