题目内容

12 An ordered table is {1, 3, 9, 12, 32, 42, 45, 65, 72, 77, 82, 95, 100},when the binary search value is 82, the search is successful after ( ) comparison.

A. 4
B. 2
C. 3
D. 5

查看答案

搜索结果不匹配？点我反馈

更多问题

13 The hash table length m = 14,the hash function H (key) = key % 11.There are 4 nodes in the table:addr(15)=4 addr(38)=5 addr(61)=6 addr(84)=7 The remaining addresses are empty.Using the method of second detection and rehash to deal with collisions,the address of the node with the keyword 49 is ( ).

A. 9
B. 8
C. 3
D. 5

查看答案

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)

查看答案

12 An ordered table is {1, 3, 9, 12, 32, 42, 45, 65, 72, 77, 82, 95, 100},when the binary search value is 82, the search is successful after ( ) comparison.

A. 4 B. 2 C. 3 D. 5

14 Collisions means ( ).

15 Dynamic search includes ( ) search.

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

A. 4
B. 2
C. 3
D. 5