Which of the following scenarios can lead to starvation in process scheduling?

Correct option is B

Starvation occurs when a low-priority process waits indefinitely because higher-priority processes keep preempting its execution. This is common in priority scheduling algorithms, where lower-priority processes may never get CPU time if higher-priority processes continue to arrive.
Important Key Points:
1. Starvation:
· A condition where a process waits indefinitely for resources or execution due to unfair resource allocation policies, such as in priority-based scheduling.
2. Deadlock vs. Starvation:
· Deadlock occurs when processes are stuck in a circular wait for resources.
· Starvation occurs when a process cannot access resources due to a scheduling policy, even if resources are available.
3. Common Cause of Starvation:
· Priority scheduling, where high-priority processes monopolize CPU time.
· Lack of proper aging mechanisms to increase the priority of waiting processes.
Knowledge Booster:
· Option (a): Refers to deadlock, not starvation, as it involves a circular wait for resources.
· Option (c): Equal priority and fair resource allocation prevent starvation.
· Option (d): In First-Come, First-Served (FCFS) scheduling, starvation does not occur since processes are executed in the order of their arrival.
· Option (e): Mutual exclusion violations and process communication mechanisms are unrelated to starvation.