Which free-space management technique uses a bitmap where each bit represents a disk block (0 for allocated, 1 for free)?
Option C is correct. A Bit Vector (Bitmap) represents each block with a single bit. It is simple and highly efficient for finding contiguous free blocks using hardware bit-finding instructions.
In a directory structure, what is the main advantage of an Acyclic-Graph Directory over a simple Tree-Structured Directory?
Option B is correct. An Acyclic-Graph Directory permits shared subdirectories and files by allowing a node to have multiple parent links, unlike a strict tree structure.
What happens when a UNIX hard link (ln file1 file2) is created for an existing file?
Option B is correct. A hard link creates another directory entry referencing the identical inode number. Deleting file1 leaves file2 intact because the inode reference count remains > 0.
How does a Symbolic (Soft) Link differ from a Hard Link in UNIX file systems?
Option C is correct. Soft links are separate files storing target path strings. They can cross file system boundaries and point to directories, unlike hard links.
In File Allocation Table (FAT) file systems, where are the linked pointers connecting file clusters stored?
Option B is correct. FAT stores block pointers in a centralized table at the start of the partition. Reading a file requires caching this table into memory to follow cluster chains.