5. Three major methods of allocating disk space for files are: contiguous, linke

Question

5. Three major methods of allocating disk space for files are: contiguous, linked, and indexed. Let us consider the indexed method. Under the indexed method assume that a block on disk is set aside as an index which contains a sorted list of keys (unique IDs) into addresses in other parts of the disk where the target data-bytes or records reside. When multiple levels of indices are used, large disk spaces can be accessed randomly, except in the final data-block that is searched sequentially. Suppose a 3-level indexing scheme is designed, where each index holds 1024 entries, and each of the final (third) level entries points to 4KB blocks data. How big a disk-drive space for data can be supported? [Show your calculations and also use a diagram to illustrate/support your answer in the space provided below]

Explanation / Answer

                   First Level (1024 entries)
                       |
                   Second level (each of the 1024 index block has 1024 index entries (1024 * 1024)
                       |
                   Third level ( points to data block)(Total entries here = 1024 * 1024 * 1024)

Every entry points to a data block of 4KB

Total Space will be : 1024 * 1024 * 1024 * 4 KB = 4294967296 KB
                   

Related Questions

Navigate

• Browse (All)
• Browse 5
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.