← 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 →- 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…
- 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?
- Q3. In the preemptive priority example, what was P1's waiting time?
- Q4. At t = 9 in the HRRN example, why was C chosen over E?
- Q5. Round Robin with a quantum larger than every burst behaves like:
- Q6. Quantum 4 ms, context switch 1 ms, every process uses its full quantum. What is the CPU efficiency?
- Q7. Which technique prevents starvation in priority scheduling?
- Q8. What does this print? (code)
- Q9. Three jobs (bursts 4, 3, 5 ms) run FCFS with a 1 ms switch between jobs. What is the CPU utilisation?
- Q10. In the lesson's non-preemptive priority example, the CPU was busy for 17 of 18 time units. What is the CPU utilisation?
- Q11. At t = 13 in the HRRN example, D has waited 7 units with a burst of 5. What is D's response ratio?
- Q12. Quantum 9 ms, context switch 1 ms, and every process uses its full quantum. What is the CPU efficiency?
- Q13. What does this print? (code)
- Q14. Why does HRRN not starve long jobs, unlike SJF?