Question

Read the below passage and answer the questions First Come First Serve (FCFS) is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival. It is the easiest and simplest CPU scheduling algorithm. In this type of algorithm, processes which requests the CPU first get the CPU allocation first. This is managed with a FIFO queue. The full form of FCFS is First Come First Serve. As the process enters the ready queue, its PCB (Process Control Block) is linked with the tail of the queue and, when the CPU becomes free, it should be assigned to the process at the beginning of the queue.

Average waiting time of all process?

Q: Average waiting time of all process?

Theaveragewaitingtimeiscalculatedbytakingthesumofallthewaitingsanddividingitbythenumberofprocesses99313449931385msThereforetheaveragewaitingis85ms

A 8.5 ms

B 9.5 ms

C 9 ms

D 4 ms

E None of these

Practice Next

Question

Average waiting time of all process?

Solution

Download the app