🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← All topics

Quiz: CPU Scheduling Numericals: questions with answers

14 questions, each with the answer and a short explanation.

Take the timed quiz + get a certificate →
  1. Q1. In non-preemptive priority scheduling (1 = highest), P1 (arrival 0, burst 4, pri 3) is running when P2 (arrival 1, pri 1) arrives. What hap…
  2. Q2. A process arrives at t = 15, the CPU has been idle since t = 14, and it starts at t = 15. What is its waiting time so far?
  3. Q3. In the preemptive priority example, what was P1's waiting time?
  4. Q4. At t = 9 in the HRRN example, why was C chosen over E?
  5. Q5. Round Robin with a quantum larger than every burst behaves like:
  6. Q6. Quantum 4 ms, context switch 1 ms, every process uses its full quantum. What is the CPU efficiency?
  7. Q7. Which technique prevents starvation in priority scheduling?
  8. Q8. What does this print? (code)
  9. Q9. Three jobs (bursts 4, 3, 5 ms) run FCFS with a 1 ms switch between jobs. What is the CPU utilisation?
  10. Q10. In the lesson's non-preemptive priority example, the CPU was busy for 17 of 18 time units. What is the CPU utilisation?
  11. Q11. At t = 13 in the HRRN example, D has waited 7 units with a burst of 5. What is D's response ratio?
  12. Q12. Quantum 9 ms, context switch 1 ms, and every process uses its full quantum. What is the CPU efficiency?
  13. Q13. What does this print? (code)
  14. Q14. Why does HRRN not starve long jobs, unlike SJF?