All MCQs

Direct communication explicitly names the communication partner in send or receive operations.
This differs from indirect communication through a mailbox or port.

Message passing transfers information as messages using operating-system communication primitives.
It is especially useful when processes do not share an address space.

Shared memory exposes a common memory region that cooperating processes access directly.
After setup, data exchange can occur without a kernel call for every individual item.

Inter-process communication provides mechanisms for data sharing, event notification, and synchronization.
Independent execution alone cannot safely coordinate related tasks.

A process whose CPU burst is shorter than the quantum releases the CPU before the timer expires.
Round robin then behaves with very little time-slice preemption for that workload.

A Gantt chart displays the execution timeline produced by a scheduling algorithm.
It helps calculate completion, waiting, turnaround, and response times.

A multilevel feedback queue changes a process's queue and priority according to CPU usage and waiting behavior.
This flexibility can favor short interactive work while still serving long jobs.

A multilevel queue scheduler partitions processes into fixed classes such as interactive and batch.
Processes do not normally move between those queues.

Aging raises the priority of a process as its waiting time increases.
Eventually, the process becomes important enough to receive CPU service.

Starvation is indefinite postponement caused by repeatedly favoring other processes.
Priority scheduling can exhibit this problem without a fairness mechanism.

Priority scheduling bases selection on a priority value rather than only arrival order or burst length.
It may be preemptive or nonpreemptive depending on the system design.

A very small quantum causes the processor to switch processes frequently.
The resulting overhead can consume a significant portion of CPU time.