## Buy/Download all MCQ Ebook
>>>**Click Here**<<<

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

## Click on any option to know the CORRECT ANSWERS

Question 1 |

Which of the following problems occur due to linear probing?

Primary collision | |

Secondary collision | |

Separate chaining | |

Extendible hashing |

**Reasoning Questions answers**

Question 1 Explanation:

Primary collision occurs due to linear probing technique. It is overcome using a quadratic probing technique.

Question 2 |

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

4 and 10 | |

2 and 6 | |

2.5 and 1.5 | |

3.5 and 1.5 |

**English literature Questions answers**

Question 2 Explanation:

Using formula, the average number of probes required for insertion is 2.5 and for a successful search, it is 1.5.

Question 3 |

What is the load factor for an open addressing technique?

1 | |

0.5 | |

1.5 | |

0 |

**Arab culture Questions answers**

Question 3 Explanation:

The load factor for an open addressing technique should be 0.5. For separate chaining technique, the load factor is 1.

Question 4 |

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

Linear probing | |

Quadratic probing | |

Double hashing | |

Rehashing |

**Commerce Questions answers**

Question 4 Explanation:

Linear probing, quadratic probing and double hashing are all collision resolution strategies for open addressing whereas rehashing is a different technique.

Question 5 |

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

True | |

False |

**Arab culture Questions answers**

Question 5 Explanation:

Using random collision resolution algorithm, the cost of an unsuccessful search can be used to compute the average cost of a successful search.

There are 5 questions to complete.