=

- Assume uniform hashing. In this scheme, the probe sequence
<for each key
*h*(*k*, 0),...,*h*(*k*,*m*- 1) >*k*is equally likely to be any permutation of

< 0, 1,...,*m*- 1 >

- 3.6.1 Result 1: Unsuccessful Search
- 3.6.2 Result 2: Insertion
- 3.6.3 Result 3: Successful Search
- 3.6.4 Result 4: Deletion

eEL,CSA_Dept,IISc,Bangalore