the reference answer GPT ᴼ ᴾ ᴱ ᴺ ᴬ ᴵ

is true. The number of keyword comparisons is directly related to the number of keywords in the hash table. As the number of keywords in the hash table increases, so does the probability of hash collisions, which in turn leads to an increase in the number of keyword comparisons.

This true or false question. Sequential lookups can be performed on either a sequential storage structure or a chain storage structure. Sequential lookups on chained storage structures, called linear linked list lookups, are less efficient than sequential lookups on sequential storage structures, but have better performance for insert and delete operations.

This judgment is basically correct. The search efficiency of hash table mainly depends on the selection of hash function and the method of dealing with hash conflicts. The loading factor is an index to measure the utilization rate of hash table space. It usually affects the performance of hash table, but for a given hash function and conflict handling method, the loading factor is not a decisive factor affecting the efficiency of hash table lookup. In practice, appropriate hash functions and conflict handling methods are generally selected to ensure the efficiency of hash table search.