Question

Part B
Answer ALL the questions
(1x55)
6. Consider a table with Il memory locations, T[1], T[2]......T[11] and the
file F consists of 8 records. A. B, C, DE, X, Y and Z. with following hash
addresses:
Record : Z. Y. X. E. D. C. B. A
H(K) : 4. 8. 2. 11. 4. 11. 5. 1
(a) Show how the file F appears in memory.
(b) Calculate the average number S of probes for successful search and the
average number U of probes for an unsuccessful search.​

Answer 1

follow me and answer your questions