Consider a hash table of size m = 10000 and the hash function h(k) = � – McqOptions

MCQOPTIONS

1.	Consider a hash table of size m = 10000 and the hash function h(k) = ∟m(kA mod 1)'┘ for A = (√5–1)/2. The location to the key k = 123456 is
A.	46
B.	47
C.	41
D.	43
Answer» D. 43

Discussion

No Comment Found

Related MCQs

Consider the method mcq ( ).IfM1 = Number of tests to exhaustively test mcq ( );M2 = Minimum number of tests to achieve full statement coverage for mcq ( ); andM3 = Minimum number of tests to achieve full branch coverage for mcq ( );then (M1, M2, M3) = ....................
Consider the following two C++ programs P1 and P2 and two statements S1 and S2 about these programs:S1: P1 prints out 3.S2: P2 prints out 4:2What can you say about the statements S1 and S2?
The output generated by the following C program does not include the value:
Consider the following pseudo-code fragment, where m is a non-negative integer that has been initialized.Which of the following is a loop invariant for the while statement?(Note: a loop invariant for a while statement is an assertion that is true each time the guard is evaluated during the execution of the while statement).
What is the output of the following ‘C’ program? (Assuming little - endian representation of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.)
What would be the output of the following C program.
Given below are three implementations of the swap( ) function in C++ .Which of these would actually swap the contents of the two integer variables p and q?
What would be the output of the following C program
The output generated by the following C program:
The output generated by the following C program