Consider the following set of processes that arrive at time 0ms. The average…
Consider the following set of processes that arrive at time 0ms.
The average waiting time using First Come First Serve (FCFS) scheduling algorithm is (in ms):
Answer: A. 26.8 — Waiting Time = Starting Time - Arrival Time Waiting time of P1 = 0 P2 = 5 - 0 = 5 ms P3 = 29 - 0 = 29 ms P4 = 45 - 0 = 45 ms P5 = 55 - 0 = 55 ms Average…
- A.
26.8
- B.
33.4
- C.
12.5
- D.
18
Attempted by 179 students.
Show answer & explanation
Correct answer: A
Waiting Time = Starting Time - Arrival Time Waiting time of P1 = 0 P2 = 5 - 0 = 5 ms P3 = 29 - 0 = 29 ms P4 = 45 - 0 = 45 ms P5 = 55 - 0 = 55 ms Average Waiting Time = Waiting Time of all Processes / Total Number of Process Therefore, average waiting time = (0 + 5 + 29 + 45 + 55) / 5 = 26.8 ms
Loading lesson…