In a file allocation system, the following allocation schemes are used : A. Contiguous B. Indexed C. Linked allocation Which of the allocation scheme(s) given above will not suffer from external fragmentation? Choose the correct answer from the options given below :
B and C only
Indexed and linked allocation can place a file’s blocks anywhere in the available free space, so they do not require one contiguous run and avoid external fragmentation. Contiguous allocation can fail when free blocks are scattered. Therefore B and C are correct; internal fragmentation and metadata overhead are separate issues.
Important Questions from File Allocation - Teaching
What is called Journaling in Linux operating system?
A magnetic tape drive writes 600000 bytes of data while the tape moves continuously at 200 inches per second. The data recording density is 1600 bytes per inch. Each record contains 100 one-byte characters, and the blocking factor is 10 records per block. Assume an interblock gap of exactly 0.6 inch between consecutive blocks. Ignore all other recording overhead, including preambles and postambles, and exclude acceleration, stopping, and any gap before the first or after the last block. What is the elapsed time from the start of writing the first data block to the completion of the last?
A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each ?
In __________ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.
In the indexed scheme of blocks to a file, the maximum possible size of the file depends on :
