First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes.Select one:TrueFalse

A reason that processing on a first-come, first-served (FCFS) basis may not be used in a multiple server queuing system isMultiple ChoiceNone of these choicesthe average wait will be shorter if separate lines are created for each server.the cost (implications) of waiting may not be equivalent for all customers.FCFS will always result in the lowest server utilization rate.

Which of the following scheduling policies allow the O/S to interrupt the currently running process and move it to the Ready state?Select one:A.preemptiveB.FCFSC.FIFOD.non-preemptive

What is the full form of FCFS?a.First-come, First Served b.Last-come, First-served c.Service In Random Order d.First Come, Last Served

Which is the most optimal scheduling algorithm?a.FCFS – First come First servedb.None of the mentionedc.RR – Round Robind.SJF – Shortest Job First

What are the disadvantages of FCFS scheduling algorithm as compared to shortestjob first (SJF) scheduling?