The improved version of FFS tried to place directory data blocks near their corresponding inode.

What will be the output from Line 3?

In p5 Part 1, a worker thread in the thread pool finds the task queue empty. What should it do?

Consider this Dockerfile: FROM ubuntu:22.04 RUN apt-get install -y python3 libfoo COPY ./app /app WORKDIR /app CMD [“python3”, “main.py”] You push this image to a registry, and later another user pushes a different image that also starts with FROM ubuntu:22.04. Roughly how much disk/bandwidth is saved by the layered image format?

Containers share the host OS kernel, while virtual machines (VMs) each run their own isolated guest kernel.

In pure linked allocation, locating the data block at logical offset N within a file may require reading O(N) blocks from disk (assuming nothing is cached).

Why does LFS update an inode by writing a new copy to the log rather than overwriting the inode in place (as FFS does)?

If two containers are both started from the same 300 MB image, the second container requires roughly another 300 MB of disk space because each container gets its own full copy of the image.

On a hard disk, reading two sectors that are adjacent on the same track is typically much faster than reading two sectors that are on different tracks and far apart on the disk.

Which of the following structures is NOT stored per cylinder group in FFS?