Question

Use job scheduler and process scheduler by using different queues, problems like deadlock and starvation can occur

A) Priority scheduling
B) Multilevel queue scheduling
C) Round-robin scheduling
D) Shortest Job First scheduling

Answer 1

Deadlock can occur in Priority scheduling and Multilevel queue scheduling, while starvation can occur in Round-robin scheduling and Shortest Job First scheduling.

Step-by-step explanation:

Out of the options given, the problem of deadlock can occur in Priority scheduling and Multilevel queue scheduling. Deadlock occurs when processes are waiting for resources that are held by other processes, creating a situation where none of the processes can proceed.

The problem of starvation, on the other hand, can occur in Round-robin scheduling and Shortest Job First scheduling. Starvation occurs when a process is unable to access the CPU or resources for an extended period of time due to the scheduling algorithm favoring other processes.