Which file allocation method provides best access time for sequential access ?

Contiguous allocation provides the best access time for sequential file access because all blocks of a file are stored in consecutive disk sectors. This allows the read/write head to move linearly across the disk with minimal seek time, as it simply reads one block after another without needing to jump between scattered locations. In contrast, linked allocation requires following pointers for each block, introducing overhead and potential seek delays even during sequential access. Indexed allocation is optimized for random access rather than sequential, as it requires accessing an index block first before reading data blocks. Therefore, for purely sequential operations where the file is accessed from start to finish without gaps, contiguous allocation minimizes mechanical disk movement and maximizes throughput.