M

Mr. Dubey • 100.69K Points
Coach

Q. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

  • (A) less than 1
  • (B) less than n
  • (C) less than m
  • (D) less than n/2
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. 2's complement of any binary number can be calculated by

Q. Massively parallel machine is

Q. Applications of Shell programming include

Q. Which table shows the electrical state of a digital circuit's output for every possible combination of electrical states in the inputs ?

Q. How many bits would be required to encode decimal numbers 0 to 9999 in straight binary codes?

Q. Consider the grammar defined by the following production rules, with two operators ∗ and + S --> T * P T --> U | T * U P --> Q + P | Q

Q. If f (x) = cos x and g(x) = x3 , then (f o g) (x) is

Q. The method of synchronising the processor with the I/O device in which the device sends a signal when it is ready is?

Q. Which of the following statement(s) can be true post adding a variable in a linear regression model? 1. R-Squared and Adjusted R-squared both increase

Q. What type of fault remains in the system for some period and then disappears?

Question analytics