City Guilds Model Questions Vol1 2024 Information Technology Question 27
Practice objective / multiple choice question 27 from the 2024 City Guilds Model Questions Vol1 Information Technology examination.
Four processes arrive as follows (arrival time in ms, CPU burst in ms): P1 (0,5), P2 (1,3), P3 (2,8), P4 (3,6). The time quantum for Round Robin is 4 ms. (a) Compute the average waiting time under First‑Come‑First‑Served. (b) Compute the average waiting time under non‑preemptive Shortest‑Job‑First. (c) Compute the average waiting time under Round Robin with the given quantum. (d) If the system requires an average waiting time not exceeding 6 ms, which algorithm(s) satisfy this requirement?
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2024 Information Technology Question 27. It is one of the objective questions from the 2024 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.