Final answer:
In linked list allocation, a corrupted block can affect access to other blocks due to the dependency on linkage continuity, whereas in contiguous allocation with bitmap, other blocks can still be read independently.
Step-by-step explanation:
File allocation methods are required to use the disk block efficiently and allow quick access to the blocks. There are Five types of allocation methods: Contiguous, Linked, Indexed, File Allocation Table (FAT), and Inode. External fragmentation is observed in contiguous allocation but not in other allocation methods.
The disk block allocation scheme would be affected by a corrupted block when reading other blocks of a file. In contiguous allocation with a bitmap vector, corruption of a single block will not affect the reading of other blocks since the blocks are stored sequentially, and the system can simply skip the corrupted one.
With the FAT (File Allocation Table) and linked list allocation schemes, however, corruption of a single block can potentially corrupt pointers or entries that inform the system of the location of the next block, which could hinder access to subsequent blocks in the file. Therefore, linked list allocation, in particular, can be affected by a single corrupted block, as the sequence of files is dependent on the linkage continuity.