City Guilds Model Questions Vol1 2019 Information Technology Question 37
Practice objective / multiple choice question 37 from the 2019 City Guilds Model Questions Vol1 Information Technology examination.
Four processes arrive at a CPU as follows: P1 at time 0 with burst 8 s, P2 at time 1 with burst 4 s, P3 at time 2 with burst 9 s, and P4 at time 3 with burst 5 s. Using the pre‑emptive Shortest Remaining Time First (SRTF) scheduling algorithm, calculate the average waiting time of the processes (in seconds).
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2019 Information Technology Question 37. It is one of the objective questions from the 2019 City Guilds Model Questions Vol1 Information Technology examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.