#Operating System

Question

Answer 1

All three statements are correct. Please refer - https://en.wikibooks.org/wiki/Operating_System_Design/File_Systems/Allocation

Answer 2

Contiguous allocation is similar to array->>So suffers from External Fragmentation.

Linked allocation is simiar to singly linked list. So if u read 10th disk block and u want to read 6th then u need to traverse again from start node like in singly linked list.

Here No External Fragmentation.

Indexed allocation:->>

Linked allocation does not support random access of files, since each block can only be found from the previous. Indexed allocation solves this problem by bringing all the pointers together into an index block. This type of allocation will have a pointer which has the address of all the blocks of a file. This method solves the problem of fragmentation as the blocks can be stored in any location.

 

So All statements are true.