Explain how one can access i th block in contiguous allocation Explain how one can access i th block in linked list allocation Will you use linked allocation for an application with direct access Explain Compare FAT with I node regarding a) RAM space requirements b) number of SEEKS required to read a Byte of information for each method Assume a hard disk has D Blocks how many entries will there be on FAT Each block can hold B Bytes It takes A Bytes to write one address Or you can say the address pointer takes A Bytes How many addresses can be contained in one block How many blocks you will need to accommodate a File of F Bytes Where F B A Define and explain the Bit vector and linked list approach to free space management Write their differences Another set of questions I node has file attributes Users sometimes save same file in multiple names In that case, do you need multiple I nodes yes or no Explain your understanding A file system has 20GB disk and blocks are of size 2KB How big is the Bit map in bits How many disk blocks will be required to store the Bit map In you use linked list method to manage free blocks, it will need 64 bits to address one block How many disk blocks will be required to keep the address of the free blocks Assume you keep the block addresses in one place in address blocks Now assume 50 of the blocks are occupied How many blocks are free now Compute the number blocks required to keep the address of the free blocks when 50 of them are occupied

Answered step by step

Verified Expert Solution

Link Copied!

Question

1 Approved Answer

Posted on Mar 30, 2022

Explain how one can access i th block in contiguous allocation? Explain how one can access i th block in linked list allocation? Will you

Explain how one can access i^th block in contiguous allocation?

Explain how one can access i^th block in linked list allocation?

Will you use linked allocation for an application with direct access? Explain.

Compare FAT with I-node regarding a) RAM space requirements b) number of SEEKS required to read a Byte of information for each method.

Assume a hard disk has D Blocks. how many entries will there be on FAT? Each block can hold B Bytes. It takes A Bytes to write one address. Or you can say the address pointer takes A Bytes. How many addresses can be contained in one block? How many blocks you will need to accommodate a File of F Bytes. Where F > B > A.

Define and explain the Bit vector and linked list approach to free-space management. Write their differences.

Another set of questions

I-node has file attributes. Users sometimes save same file in multiple names? In that case, do you need multiple I-nodes? yes or no- Explain your understanding.

A file system has 20GB disk and blocks are of size 2KB

How big is the Bit map in bits?
How many disk blocks will be required to store the Bit map?
In you use linked list method to manage free blocks, it will need 64 bits to address one block. How many disk blocks will be required to keep the address of the free blocks. Assume you keep the block addresses in one place in address blocks
Now assume 50% of the blocks are occupied: How many blocks are free now?
Compute the number blocks required to keep the address of the free blocks when 50% of them are occupied.

Step by Step Solution

★★★★★

3.42 Rating (174 Votes )

There are 3 Steps involved in it

Step: 1

Explanation The inode stores the metadata of a directory or file and it points to the data block or first few data blocks but the inode doesnt store the hard link name The inode store the information ... blur-text-image