In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.
Show answerHide answer
Correct answer: (B) Linked
Explanation
Just like linked list where insertion, deletion of blocks is easy. In linked allocation only pointer needs to be changed. In linked allocation each file is a linked list of disk blocks. The directory contains a pointer to the first block of the file, for example, a file of 5 blocks which starts at block 4, might continuous at block 7, then block 16, block 10, 8 finally block 27. Each block constrains a pointer to the next block & the last block contains a NIL-pointer. The value-1 may be used for NIL to differential it from block 0.