FCFS

Which one of the following CPU scheduling algorithms cannot be preemptive?

Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst...

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? Process Arrival Time Processing Time A 0 3...

Consider the $$3$$ processes, $$P1,$$ $$P2$$ and $$P3$$ shown in the table. Process Arrival Time Time Units Required P1 0 5 P2 1 7 P3 3 4 The completion order of the $$3$$ processe...

Which of the following statements are true? $${\rm I}.$$ Shortest remaining time first scheduling may cause starvation $${\rm II}.$$ Preemptive scheduling may cause starvation $${\...

Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served $$(FCFS...

Which of the following scheduling algorithms is non-preemptive?

Which of the following scheduling algorithms is non-preemptive?

The head of a moving head disk with $$100$$ tracks numbered $$0$$ to $$99$$ is currently serving a request at tract $$55.$$ If the queue of requests kept in $$FIFO$$ order is $$10,...

Disk requests come to disk driver for cylinders $$10,22,20,2,40,56$$ and $$38,$$ in that order at a time when the disk drive is reading from cylinder $$20.$$ The seek time is $$6ms...