Question

Which one is true for FCFS scheduling

• A. It is simplest CPU scheduling
• B. Average waiting time under the FCFS policy, however is often quite long
• C. FCFS scheduling algorithm is non preemptive
• D. All of above

Answer 1

The correct option is D All of above

FCFS scheduling:-

1) It is simplest CPU scheduling

2) Average waiting time under the FCFS policy, however is often quite long

3) FCFS scheduling algorithm is non preemptive.

First come, first served (FCFS) is an operating system process scheduling algorithm and a network routing management mechanism that automatically executes queued requests and processes by the order of their arrival. With first come, first served, what comes first is handled first; the next request in line will be executed once the one before it is complete.