HASHING ALGORITHM
The systems programmer uses a hashing algorithm to determine storage addresses. The hashing structure is 9,997/key. The resulting number is then used to locate the record. The first two digits after the decimal point represent the cylinder number, while the second two digits represent the surface number. The fifth, sixth, and seventh digits after the decimal point represent the record number. This algorithm results in a unique address 99 percent of the time. What happens the remainder of the time when the results of the algorithm are not unique? Explain in detail the storage process when key value 3 is processed first, key value 2307 at a later date, and shortly thereafter key value 39.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.