Register

BME entrance exam

390 views
0 0 votes

A hash function h maps 16-bit inputs to 8-bit hash values. What is the largest k such that in any set of 1000 inputs, there are at least k inputs that h maps to the same hash value?

1 Answer

0 0 votes
Input Bits = 16 bit and Hash value = 8 bit . So, there are 2^8 = 256 values which is k.
Voting & Accepting an answer helps improve the community
← Previous · #Doubt #GO+Gateoverf...Next → · BME entrance exam
← Previous in category · Permutation and comb...Next in category → · BME entrance exam
Position:
Show:

Related questions

0 0 votes
0 0 answers
322
322 views
Ilqar asked Apr 2, 2024
322 views
BME entrance exam
A data file of 1,000,000 records must be stored using bucket hashing. Record length is 350 bytes, the net capacity of a block is 2000 bytes. Keys occupy 32 bytes, while p...
0 0 votes
0 0 answers
2
2 views
Srishti_Mishra asked May 3
2 views
Iit kanpur pnd entrance exam
This post was deleted with below mentioned reason.
Delete Reason Name: Content is not proper to be allowed
Delete Reason Note:
Has Author Submitted Revision Edit?: NOT YET
The post is awaiting revision edit from its author accordingly with mentioned reason.
0 0 votes
0 0 answers
604
604 views
vamshikrishna asked Feb 17, 2019
604 views
IIIT hyd entrance exam
Any IIIT-hyd pgee previous year exam questions?
15 15 votes
3 answers 3 answers
4.2k
4.2k views
Shreya Roy asked Apr 5, 2017
4,194 views
ISI Entrance Exam MTech (CS)
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than $1$ in a given tree. What is the maximum possible value of $k$?