题目内容

10 When binary searching for a linear table, a linear table ( ) is required.

A. B and C
B. orderly
C. sequentially stored
D. no correct answer

查看答案

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

更多问题

11 The sequential search method is suitable for linear tables with a storage structure of ( ).

A. sequential or chained storage
B. hash storage
C. compression storage
D. indexed storage

查看答案

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

查看答案

10 When binary searching for a linear table, a linear table ( ) is required.

A. B and C B. orderly C. sequentially stored D. no correct answer

11 The sequential search method is suitable for linear tables with a storage structure of ( ).

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.

14 Collisions means ( ).

A. B and C
B. orderly
C. sequentially stored
D. no correct answer