Allocation Methods. Explain how one can access ith block in contiguous allocation? Explain how one can access ith 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 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. Please answer everything ASAP.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Allocation Methods.

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 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.

Please answer everything ASAP.

Expert Solution