Neco 2024 Data Processing Question 11

A file contains \(5{,}000\) records, each \(250\) bytes long. The storage medium uses blocks of \(1{,}024\) bytes. Compare the total storage required (in bytes) for the following file‑organization methods and state which method uses the least storage:\n\n1. Sequential organization (records stored consecutively).\n\n2. Indexed sequential organization, where an index block stores a \(4\)-byte pointer for each data block.\n\n3. Direct (hashed) organization, assuming each record occupies its own block and \(5\)% of the records suffer a collision, each requiring an additional overflow block.\n\nAssume that any partially‑filled block still occupies a full block. Provide the storage amounts for each method and identify the method with minimum storage.