438 views
0 votes
0 votes
For a given class, the student 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 most appropriate?

1 Answer

0 votes
0 votes
Indexed allocation as the records are randomly accessed and updated.

Related questions

1 votes
1 votes
3 answers
4
admin asked Oct 27, 2019
1,869 views
Consider a $4-TB$ disk that uses $4-KB$ blocks and the free-list method. How many block addresses can be stored in one block?