[Solved]10 Points Consider Two Open Address Hash Tables Tl0 M 1 Linear Probing Ti M 1 Linear Prob Q37241682
![(10 points) Consider two open address hash tables Tl0,.., (m - 1) with linear probing and TI, , (m-1)] with linear probing, w](https://media.cheggcdn.com/media%2F12f%2F12f5a95c-b76d-42ea-9362-6d48c1306ebe%2FphpltrRMY.png)
(10 points) Consider two open address hash tables Tl0,.., (m – 1) with linear probing and TI, , (m-1)] with linear probing, where m = 100. Assume simple uniform hashing and that there are no deletions. Suppose that in T1 every odd index is occupied and remaining slots are empty. While in table T, T2l0,,49] is occupied, and the remaining slots are empty (a) (5 points) Find the probability that the slot T1[50 will be filled in the next insertion. Explain. (b) (5 points) Find the probability that the slot T 150 will be filled in the next insertion. Explain. Show transcribed image text (10 points) Consider two open address hash tables Tl0,.., (m – 1) with linear probing and TI, , (m-1)] with linear probing, where m = 100. Assume simple uniform hashing and that there are no deletions. Suppose that in T1 every odd index is occupied and remaining slots are empty. While in table T, T2l0,,49] is occupied, and the remaining slots are empty (a) (5 points) Find the probability that the slot T1[50 will be filled in the next insertion. Explain. (b) (5 points) Find the probability that the slot T 150 will be filled in the next insertion. Explain.
Expert Answer
Answer to (10 points) Consider two open address hash tables Tl0,.., (m – 1) with linear probing and TI, , (m-1)] with linear probi… . . .
OR

