# Uniform Hashing Assumption

https://en.wikipedia.org/wiki/SUHA_(computer_science)

Learned in CS240:

Uniform Hashing Assumption

$U$ is finite and any hash-function is equally likely to be chosen as a hash-function.

From Wikipedia: SUHA is a basic assumption that facilitates the mathematical analysis of hash tables. The assumption states that a hypothetical hashing function will evenly distribute items into the slots of a hash table.