Question

Which of the following statements is true with respect to the processes in a ready queue involving a non-preemptive scheduling algorithm?


I: As each process becomes ready, it joins the ready queue.

II: When the current running process finishes execution, the oldest process in the ready queue is selected to run next.




1)I only


2)Both I and II


3)Neither I nor II


4)II only

Answer 1

The following statement is true with respect to the processes in a ready queue involving a non-preemptive scheduling algorithm ii)When the current running process finishes execution, the oldest process in the ready queue is selected to run next.

Answer 2

Explanation:

When the current running process finishes execution, the oldest process in the ready queue is selected to run next”. Is the correct reply, as in preemptive scheduling algorithm the executing process waits till the completion and continues to be in the running state with no overhead processing from running state to ready state. CPU allocate to the process unless switches to waiting state or terminates.