Question 76
In double hashing, the probe position is typically determined using:
Double hashing uses one hash function for the initial slot and another to determine the probe increment, reducing clustering when chosen appropriately.
In double hashing, the probe position is typically determined using:
Double hashing uses one hash function for the initial slot and another to determine the probe increment, reducing clustering when chosen appropriately.
What is the expected search time in a well-designed hash table with a controlled load factor?
With a suitable hash function and controlled load factor, the expected number of probes or bucket elements examined remains bounded by a constant.
Which data structure supports efficient prefix lookup for strings?
A trie stores characters along paths from the root. Searching a key or prefix of length L takes O(L) time, independent of the number of stored words apart from alphabet representation costs.
Which algorithm finds a pattern in text using an LPS (longest proper prefix which is also suffix) array?
KMP preprocesses the pattern into an LPS array so that after a mismatch it reuses already matched prefix information instead of restarting from the next text character.
Which string-matching algorithm commonly uses a rolling hash?
Rabin-Karp computes a hash for the pattern and for each text window, updating the window hash efficiently as it slides. Hash matches are verified to avoid collision errors.