Directions (Q96–100): Consider the following set of processes with arrival time and CPU burst time given in milliseconds (ms):
| Process | Arrival Time | Burst Time |
|---|---|---|
| P1 | 0 | 5 |
| P2 | 2 | 3 |
| P3 | 2 | 2 |
| P4 | 5 | 3 |
| P5 | 6 | 1 |
What is the average turnaround time for these processes with the First Come First Serve (FCFS) scheduling algorithm?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. 7.0 ms
Explanation
FCFS: P1 0–5, P2 5–8, P3 8–10, P4 10–13, P5 13–14. TAT = completion − arrival: 5, 6, 8, 8, 8. Average = 35/5 = 7.0 ms.More System Software and Operating System questions
- What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling?
- When we apply the Shortest Job First (SJF) scheduling algorithm, process P2 faces partial starvation and waits a longer time to execute. Wh…
- Which of the following statements are TRUE about mutual exclusion in concurrent programming? (A) Mutual exclusion ensures that only one pro…
- Which of the following statements are TRUE about privileged instructions? (A) They can only be executed by the operating system kernel and…
- Match List I (Algorithms) with List II (Characteristics)List I List II (A) First Come First Served (FCFS) (I) Each process is assigned a pr…
- Match List I (operating system concepts) with List II (characteristics)List I List II (A) Paging (I) Evicts least recently used page (B) LR…