For a given class the studen records are stored in a file Th

For a given class, the studen records are stored in a file. The records are randomly accessed and updated. Assume that each student\'s record is of fixed size. Which of the three allocation schemes (contiguous, linked and table/indexed) will be the most appropriate?

Solution

As each file has its own index block which stores the addresses of memory occupied by the file so Table/indexed allocation scheme would be most appropriate as we can easily access any block with help of index,