Operating System & Unix

A process can only initiate the 'block' transition itself when it requests I/O. Other transitions like wakeup (timer I/O completion), dispatch (scheduler decision), and sleep are system-initiated by the OS.

A page fault is triggered when the CPU references a virtual memory page not currently loaded in physical RAM. The OS must then load it from disk. Option B describes normal operation, C is a different error, and D is a software exception.

When a BLOCKED process completes its I/O operation, the OS moves it to READY state. It then waits for the scheduler to dispatch it. It cannot directly resume running - must go through ready queue.

Mutual exclusion is specifically required when multiple processes share common resources and access them concurrently. Without proper synchronization, race conditions can occur leading to inconsistent states or corruption. The problem doesn't apply to disjoint processes that don't share resources or when processes use completely different resources.

A real-time system is one that must respond to inputs within strict time constraints - missing a deadline can cause system failure. Aircraft control systems are classic examples because they must process sensor data and adjust controls within milliseconds to maintain flight safety. Payroll processing and library systems have no critical timing requirements.

Overlay allows running large programs that exceed available memory by swapping program parts in and out of the same memory region. Only the currently executing portion needs to be in memory at any time. This extends effective memory without requiring physical RAM for the entire program.

MS-DOS (Microsoft Disk Operating System) is a classic example of a single-user, single-tasking operating system.

Shared memory is a method used in operating systems to allow multiple processes to access the same memory space for inter-process communication (IPC).

The virtual address space size is determined by the number of bits in the address bus of the processor. For example, a 32-bit address bus supports 2^32 bytes of virtual memory.

Deadlock requires four simultaneous conditions: mutual exclusion, hold and wait (partial allocation), no preemption, and circular wait. Since options A and B cover these four conditions, the combination of both is necessary.

Belady's Anomaly refers to the phenomenon where increasing the number of page frames results in an increase in the number of page faults for certain memory access patterns. This is a well-known characteristic of the First-In-First-Out (FIFO) algorithm. LRU and Optimal replacement do not suffer from this anomaly.

An attempt to read a locked file typically results in the process being blocked or receiving an error code from the operating system, rather than a deadlock, system crash, or termination. Since none of the specific options describe the standard behavior, 'none of the above' is the most accurate choice.

Aging is a technique used in CPU scheduling to prevent starvation. By gradually increasing the priority of processes that have been waiting in the system for a long time, it ensures that even low-priority jobs will eventually be executed.

In shell scripting environments, specific characters or commands are used to denote comments that the interpreter should ignore. While the question phrasing is slightly ambiguous, indicating comments is a fundamental feature of shell scripts.

System calls provide an interface between a process and the operating system. When a user process requests a service from the kernel, the CPU switches from user mode to kernel mode to execute the privileged operation.

A sector is the smallest physical storage unit on a disk drive. Tracks are concentric rings, and sectors are subdivisions of those tracks.

A Unix shell is a command-line interpreter that provides a user interface for accessing the services of the operating system. It reads commands from the user and executes them.

DMA stands for Direct Memory Access. It is a feature that allows hardware subsystems to access main system memory independently of the central processing unit.

Semaphores are synchronization primitives used to manage access to shared resources by multiple processes. They are primarily used to solve process synchronization problems, such as mutual exclusion.

A dirty bit is a flag associated with a block of memory (like a page) that indicates whether the data has been modified since it was loaded into memory. If the bit is set, the page must be written back to disk before being replaced.

The getpid() system call returns the process ID of the calling process. Since every process has a valid PID, this call is guaranteed to succeed and does not return an error.

Concurrent processes are processes that exist at the same time, meaning their execution periods overlap. They do not necessarily execute at the exact same instant (which is parallelism), but they are active simultaneously.

Disk scheduling algorithms are used by the operating system to determine the order in which pending I/O requests to the disk are processed to optimize performance, such as reducing seek time.

Shortest Job First (SJF) is mathematically proven to provide the minimum average waiting time for a given set of processes by executing the shortest tasks first.