The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
543 views

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than _____

  1. 1
  2. 1/n
  3. 1/m
  4. n/m
asked in CBSE/UGC NET by Active (3.9k points) | 543 views

2 Answers

0 votes

Answer is less than 1. Though it is not mentioned in the options tat r given. It is a scenario of Universal Hashing. Please kindly visit d link given below for more information. 

http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap12.htm

answered by Boss (13.5k points)
0
options 2,3,4 are all less than one. Which is correct answer?
0 votes
answered by Loyal (7.3k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,828 questions
46,802 answers
140,990 comments
58,948 users