单项选择题

A hash table with hash function is shown below.H₁(k)=k mod 13
Collision is resolved using the hash function H₂(k)=(k mod 11)q-1. How many key comparisons occur in searching for key 62 in the given hash table ( )

A．1
B．2
C．3
D．4

<上一题目录下一题>

热门试题

单项选择题

The sorting method described by the following code is called( ). FOR i:=1 TO n—1 do BEGIN k: =i; FOR j: =i+1 TO n DO IF A[j]＜A[K] THEN k:=j; IF k＜＞i THEN BEGIN x:=A[k]; A[k]: = A[i]; A[i]:=x END END;

A．insertion sort
B．selection sort
C．radix sort
D．merge sort

单项选择题

The figure below Shows a record used for recording information about a named event. Which of the following statement is incorrect ( ) VAR r: RECORD event: ARRAY[1.. 10] of Char; place: ARRAY[1.. 20] of RECORD plname: ARRAY[1.. 15]of Char; date: ARRAY[1.. 5] of RECORD mo: 1.. 12; day: 1..31; year: Integer END END END;

A．This is a one—dimensional array of records, also called a table
B．The event can occur in up to 20 places and on up to 5 different dates in each place
C．This is so called record of arrays
D．A reference to place, date, mo will access the month of the jth occurrence, in the ith place, of the event named in event

相关试题