# Data Structures :: Hashing

**Home**>

**Data Structures**>

**Hashing**>

**Discussion**

## 1. 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 :

**Answer:**

**Option A**

**Explanation :**

There is no Explanation for this Answer.

No Discussion on this question yet!