Distribution hash table with probability computing: You have n people, m object...

khanh3570883

New member
Joined
Jun 13, 2017
Messages
1
Hello everyone, i'm a student and my major is software engineering. I have a problem and i hope that people can help me.

About distribution hash table, you can imagine that there is a table that stores the addresses of objects and each person holds a part of that table.

And my problem is:

You have n people, m object. Let X be the number of addresses in the table that a person holds. Expect E(max(X)) = ?
 
Time for you to share your thoughts. It's your major.
 
Top