Suppose a file currently consisting of 50 blocks. Assume that the directory is a

Question

Suppose a file currently consisting of 50 blocks. Assume that the directory is already memory, but the index block is not in memory yet in case for the indexed allocation. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if, for one block, the following conditions hold. In the contiguous allocation case, assume that there is no room to grow at the begging but there is room to grow at the end. In addition, assume that the block information to be added is stored in memory.

a.The block is added the beginning.

b.The block is added the middle.

c.The block is added at the end.

d.The block is deleted from the beginning.

e.The block is deleted from the middle.

f.The block is deleted from the end.

Explanation / Answer

Hi,

The disk I/O operations are required for contiguous, linked, and indexed for 50 Blocks.............

Contiguous Linked Indexed
                      a. 101                   1                      1
                      b. 51 25 1
                      c.                  1 3 1
                      d. 98 1 0
                      e. 48 25 0
                      f.                    0 50 0

Thank You.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

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