Question 14

A hash table with 10 buckets with one slot per bucket is depicted in fig. The symbols, S1 and S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

Create a FREE account and get:

Download Maths Shortcuts PDF
Get 300+ previous papers with solutions PDF
500+ Online Tests for Free

CAT Quant Questions | CAT Quantitative Ability

CAT Probability, Combinatorics Questions CAT Data Sufficiency Questions CAT Averages, Ratio and Proportion Questions CAT Quadratic Equations Questions CAT Time Speed Distance Questions

CAT DILR Questions | LRDI Questions For CAT

CAT Games and Tournamnents Questions CAT Quant Based DI Questions CAT Truth Lie Concept Questions CAT Puzzles Questions CAT Data Interpretation Basics Questions

CAT Verbal Ability Questions | VARC Questions For CAT

CAT Critical Reasoning Questions CAT Para Summary Questions CAT Miscellaneous Questions CAT Vocabulary Questions CAT Para Jumbles Questions

Follow us on

Boost your Prep!

Download App