When i solve this I got various answers How??

I am using Red Hat Linux 9.0 version.....A challeging Q for OS gurus!!!....Consider a file currently consisting of 100 blocks. Assume that the
PCB, bit vector block, index block (in case of indexed allocation), and
Directory block are in the main memory. Calculate the number of I/O
Operations required adding a new block in the middle of the file for
Contiguous, linked, and indexed allocation techniques. For
Contiguous allocation, assume that there is no room to grow in the
Beginning or end of file. Also assume that block information to be
Added is in a kernel buffer. Show your work.
Contiguous Allocation:
Linked Allocation:
Indexed Allocation:

Any help, advise is appreciated!!

Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!