Discussion
Which file allocation method provides best access time for sequential access ?
Answer: A
The method is contiguous allocation.
In contiguous allocation a file occupies consecutive blocks on the disk, so reading it in order needs little or no head movement between blocks. Any block can also be located directly from the start address and length. Both sequential and direct access are as fast as they can be.
Linked allocation scatters blocks and has to follow pointers one by one. Indexed allocation needs index block lookups, and its data blocks may also be scattered. Hashed allocation is a way of organising directories, not a file block allocation method.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development