This option is correct because in real-time operating systems, a rigid time limit is placed on the operation of the processor or on the flow of data.

The distributed systems are physically separated computers, which are combined together through a network so that they can communicate and share computational tasks and provide a rich set of features to the users.

The kernel is a part of operating system, which loads first and remains in the main memory, until the computer is shut down. It is responsible for the services and the functions of the operating systems.

This option is correct, as program the counter indicates the address of the next instruction to be executed for the process.

This option is correct. Whenever an interruption occurs, the execution of currently running process stops and it goes to the ready state, where it waits to be assigned to a process.

This option is correct because when a process needs the access to the CPU, it waits in the ready queue to get the access.

Demand paging is a method of virtual memory management. In a system that uses demand paging, the operating system copies a disk page into its physical memory, only if an attempt is made to access it. So, this option is correct.

Segmentation divides the primary memory into segments. When the dynamic memory allocation algorithm allocates some memory and a small piece is left over, which cannot be efficiently used, then the external fragmentation takes place.

This option is correct.

In the running state, the process gets the access to the CPU and starts its execution.

In paging memory-management scheme, the operating system retrieves the data from secondary storage in the same-sized blocks called pages. Some space is wasted inside the memory blocks because of the restriction on the allowed size of the block, which causes internal fragmentation.

This option is correct. If the CPU is busy executing processes, then the work is being done. This work done is calculated on the basis of number of processes completed per unit time and this measure is known as throughput.

In priority based scheduling, aging technique gradually increases the priority of the processes that is waiting in the system for a long time.

If the time quantum is large enough, it will behave as a non-preemptive algorithm, but if the time quantum is too small, then it will behave as preemptive algorithm. So, this is the required answer as this statement is incorrect.

This option is correct, as the dispatcher is involved each time a process switches, and the time taken to stop one process and start running another process is known as dispatch latency.