題組內容

5.[Hash and Heap: ]

61e50f9f199c6.jpg

(1) Supposing that we store n keys in a hash table with size of n' by a universal hash function, prove that the collision probability is less than 0.5.