题目内容

14 Collisions means ( ).

A. different key values correspond to the same storage address
B. the two elements have the same sequence number
C. the two elements have different key values
D. the two elements have different key values

查看答案
更多问题

15 Dynamic search includes ( ) search.

A. binary sort tree
B. sequence table
C. order table
D. index sequential table

16 Find the hash table with n elements, and the average search length is ( ).

A. not directly depend on n
B. O(n2)
C. O(log2n)
D. O(n)

17 The main criterion to measure the efficiency of the search algorithm is ( ).

A. average search length
B. number of elements
C. the amount of storage required
D. the difficulty of the algorithm

18 A search without adding, deleting or modifying is called ( ).

A. static search
B. internal creation
C. dynamic search
D. external search

答案查题题库