If you have any queries please leave a message here
Each file has an index block that is an array of disk block addresses.
The i-th entry in the index block points to the i-th block of the file.
A file’s directory entry contains a pointer to its index. Hence, the index block of an indexed allocation plays the same role as the page table.
Index allocation supports both sequential and direct access without external fragmentation.
The indexed allocation suffers from wasted space. The index block may not be fully used (i.e., internal fragmentation).
File size limitation depends on array size for example if we have (256) pointers in the index block then the maximum file size will be 256KB assuming 1KB data blocks. To overcome this problem
we can have multiple index blocks and chain them into a linked list.
We can also have multiple index blocks, but make them a tree just like the indexed access method.
we can have a combination of both.
QuestionSolves.com is an educational website that helps worldwide students in solving computer education related queries.
Also, different software like Visual Studio, SQL Server, Oracle etc. are available to download in different versions.
Moreover, QuestionSolves.com provides solutions to your questions and assignments also.
IGNOU Assignment Solution
IGNOU Question Paper Solution
WHAT WE DO
Provide BCA, MCA Projects
Provide Assignment & Question Paper Solution
12/18, Padmapukur Road, Netaji Nagar, Kolkata-700092, West Bengal, India
Copyright Ⓒ 2017-19