9. Consider the following algorithm A: H: hash table (empty buckets store number-1) N: number of...

  

Transcribed Image Text:

9. Consider the following algorithm A: H: hash table (empty buckets store number-1) N: number of buckets of the hash table k: an integer number 1 NM + in 67 2 3 4 5 7 function A(H,N, K) i=(2*K) %N for 0 <= j < N NF What is the content of the 5-bucket hash table H - originally empty- after executing the following instructions? 2 if(H[(i+1)%N] ==-1) H[(1+1)%N] =k break end function 1 A(H, 5,4) A(H, 5,9) 3 A(H, 5,14) none of the others. [14,-1,-1, 4, 9] [4,9, 14,-1,-1] O [-1,-1,-1, 4, 9] O [3,-1,-1, 3, 3] 9. Consider the following algorithm A: H: hash table (empty buckets store number-1) N: number of buckets of the hash table k: an integer number 1 NM + in 67 2 3 4 5 7 function A(H,N, K) i=(2*K) %N for 0 <= j < N NF What is the content of the 5-bucket hash table H - originally empty- after executing the following instructions? 2 if(H[(i+1)%N] ==-1) H[(1+1)%N] =k break end function 1 A(H, 5,4) A(H, 5,9) 3 A(H, 5,14) none of the others. [14,-1,-1, 4, 9] [4,9, 14,-1,-1] O [-1,-1,-1, 4, 9] O [3,-1,-1, 3, 3]

Answer rating: 100% (QA)

Lets follow the algorithm A and execute the provided instructions step by step Initially the hash ta... View the full answer