Using an operating system and file management

The governing concept is thrashing. It happens when a system has too little available physical memory for its active workload, so it repeatedly moves pages between main memory and storage. The processor then spends more time handling page faults and swapping than executing useful instructions, causing severe slowdown. Therefore option C is correct. Partitioning, indexing, and archiving do not describe this repeated paging problem.

The governing concept is file-system journaling. Before or while applying important metadata changes, the system records planned operations in a journal. If power fails or the computer shuts down unexpectedly, the operating system can inspect that record and complete or undo incomplete changes, helping restore file-system consistency more quickly. Thus option D is correct. Journaling does not halve files, make them read-only, improve the monitor, or replace a backup.

The governing concept is metadata: data that describes another data object. File-system metadata commonly records the name, size, owner, permissions, creation or modification time, and location-related information, while the file contents are stored separately. Therefore, option A is correct. Option B describes contents, and options C and D concern unrelated device or network information.

The governing concept is indirection: a symbolic link stores a reference to a target path instead of duplicating the target's contents. Like a normal shortcut, it directs the operating system or user to another file or location. Thus option B is correct. Option A confuses a link with a copy, while C and D describe destructive operations that links do not perform.

The governing concept is inode or file-record sharing. A hard link is an additional directory entry referring to the same underlying file data, so the original name and the hard-link name access that data equally. Therefore option C is correct. It is not an internet link, is normally restricted to the same file system, and does not compress the data.

The governing concept is integrity checking with a deterministic digest. A hash function calculates a compact value from a file's bytes; comparing it with a trusted earlier value can reveal alteration or corruption. Therefore option D is correct. Hashing does not print, move, or grant permissions to a file, so A, B, and C are unrelated.

The governing concept is the all-or-nothing property of a transaction. If every required part of an update succeeds, the system commits the complete change; if a failure occurs, it rolls the operation back rather than leaving a partial result. Thus option A is correct. The other options concern size, access control, or printing, not atomicity.

The governing concept is buffer management. Programs may temporarily hold written data in memory for efficiency; flushing explicitly requests that this pending data be written to the underlying storage while the file remains open. Therefore option B is correct. Partitioning divides storage, renaming changes a label, and compression changes representation; none means writing a buffer out.

The governing concept is delayed persistence. Write caching improves speed by keeping recently written data in fast memory before sending it to permanent storage. If power fails or a device is removed before the write completes, the pending data may be lost or the file may be inconsistent. Therefore option C is correct; A, B, and D are unrelated effects.

The governing concept is controlled concurrent access. A file lock signals that a process or user is reading or modifying a file, allowing the system to restrict conflicting operations or coordinate them. Thus option D is correct because it helps prevent lost updates and inconsistent data. Locking does not enlarge, rename, or hide a file, so A, B, and C are incorrect.

The governing concept is concurrent version divergence. If the same file is edited independently on two devices before synchronization, each device may contain changes that the other does not. The service may be unable to merge them automatically, creating a conflict that requires comparison or a choice of version. Therefore option B is correct; A, C, and D do not create competing file versions.

A directory entry provides the information the operating system uses to identify and locate a file’s data. If that entry is damaged, the data blocks may remain on the device, but the system may not know their correct name or location. Option D is therefore correct. Corruption does not automatically enlarge the file, alter the monitor, or double processor speed.

Magnetic hard drives use a moving read/write head and rotating platters. When a file is fragmented, its pieces are stored in separated locations, so the head must seek between them while reading the file. These extra movements increase access time and reduce performance. Option A is correct; fragmentation does not rename or hide a file and cannot make main memory permanent.

Traditional defragmentation mainly helps magnetic disks by placing file blocks closer together and reducing movement of a mechanical read head. Solid-state storage uses electronic memory and has no mechanical seek movement, so separated blocks usually do not create the same access penalty. Option B is correct. An SSD still has a file system, stores permanent data, and can read files normally.

A file-system checking utility examines structures such as directories, file records, allocation information, and links between names and storage locations. It reports or may repair inconsistencies that could cause missing files or access errors. Option C is correct. It is not a font editor, display-control tool, or operating-system renaming utility; antivirus software serves a different purpose.

When a file is deleted, the operating system often marks its space as available rather than immediately erasing every data block. Writing new files can reuse those blocks and overwrite parts of the deleted content, reducing or destroying recovery chances. Option D is correct. The risk concerns storage reuse, not monitor damage, main-memory reduction, or file-name length.

A checksum is a value calculated from a file’s contents using a defined algorithm. If the checksum made before transfer matches the checksum calculated after transfer, it provides evidence that the contents were not changed during transmission or storage. Option A is correct. A checksum does not select colors, rename folders, or measure mouse movement, and its verification role differs from access permissions.