# solve these 3 questions,”

solve these 3 questions,”

1. Suppose a file currently consists of 10 blocks. Assume that the file control block (i.e., inode) is already in memory. Assume that there are free disk blocks available after block 10 ofthe file. Each block read or write takes 1 disk 1/O operation. Calculate how many disk I/O operations are required for contiguous allocation scheme if a new block is

a (3) inserted in the middle (i.e., after block 5) of the file.

b (3) inserted at the end of the file (i.e., after block 10) of the file.

2 (4) Solve the above problem with the linked allocation scheme.

3.(4) Solve the above problem with the indexed allocation scheme. Assume that the index block is already loaded in MM.

 .

Do you need a similar assignment done for you from scratch? We have qualified writers to help you. We assure you an A+ quality paper that is free from plagiarism. Order now for an Amazing Discount! Use Discount Code “Newclient” for a 15% Discount!NB: We do not resell papers. Upon ordering, we do an original paper exclusively for you.

1. Suppose a file currently consists of 10 blocks. Assume that the file control block (i.e., inode) is already in memory. Assume that there are free disk blocks available after block 10 ofthe file. Each block read or write takes 1 disk 1/O operation. Calculate how many disk I/O operations are required for contiguous allocation scheme if a new block is

a (3) inserted in the middle (i.e., after block 5) of the file.

b (3) inserted at the end of the file (i.e., after block 10) of the file.

2 (4) Solve the above problem with the linked allocation scheme.

3.(4) Solve the above problem with the indexed allocation scheme. Assume that the index block is already loaded in MM.

 

1. Suppose a file currently consists of 10 blocks. Assume that the file control block (i.e., inode) is already in memory. Assume that there are free disk blocks available after block 10 ofthe file. Each block read or write takes 1 disk 1/O operation. Calculate how many disk I/O operations are required for contiguous allocation scheme if a new block is

a (3) inserted in the middle (i.e., after block 5) of the file.

b (3) inserted at the end of the file (i.e., after block 10) of the file.

2 (4) Solve the above problem with the linked allocation scheme.

3.(4) Solve the above problem with the indexed allocation scheme. Assume that the index block is already loaded in MM.