# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

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

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which of the following schemes does quadratic probing come under?

rehashing | |

extended hashing | |

separate chaining | |

open addressing |

Question 1 Explanation:

Quadratic probing comes under open addressing scheme to resolve collisions in hash tables.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Quadratic probing overcomes primary collision.

True | |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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

active deletion | |

standard deletion | |

lazy deletion | |

no deletion |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

In quadratic probing, if the table size is prime, a new element cannot be inserted if the table is half full.

True | |

False |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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

F(i)=i ^{2} | |

F(i)=i | |

F(i)=i+1 | |

F(i)=i ^{2}+1 |

Question 5 Explanation:

The function of quadratic probing is defined as F(i)=i

^{2}. The function of linear probing is defined as F(i)=i. There are 5 questions to complete.