Question

.Assume the following schedule for a set of three jobs, A, B, and C, with a single CPU. Assume that there is no i/o. --A runs first (for 10 time units) but is not yet done. --B runs next (for 10 time units) but is not yet done --C runs next (for 10 time units) and runs to completion --A runs to completion (for 10 time units) --B runs to completion (for 5 time units) Which scheduling disciplines could allow this schedule to occur? Explain. (a) FIFO (b) Round Robin. (c) STCF (Shortest Time to Completion First)

Answer 1

Check the explanation

Step-by-step explanation:

Kindly check the attached images below to the see the step by step explanation to the question above.