Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 DBMS File Organization and Indexing Hashing
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
1
4
2
5
3
6
4
3
5
Question Not Attempted