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

Quiz: CPU Scheduling: questions with answers

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

Take the timed quiz + get a certificate →
  1. Q1. Turnaround time is:
  2. Q2. Which algorithm gives the minimum average waiting time among non-preemptive schedulers?
  3. Q3. A long CPU-bound process at the front makes many short processes wait. This is the:
  4. Q4. P1 (arrival 0, burst 4) and P2 (arrival 1, burst 2), FCFS. What is P2's waiting time?
  5. Q5. What happens if the Round Robin time quantum is very large?
  6. Q6. Which of these scheduling algorithms is preemptive?
  7. Q7. With SRTF, P1 arrives at 0 with burst 6 and P2 arrives at 2 with burst 2. What is P1's waiting time?
  8. Q8. In the lesson's Round Robin example (quantum 2), P3 arrives at 2 and first gets the CPU at 4. What is its response time?
  9. Q9. How does aging solve starvation in priority scheduling?
  10. Q10. What is the main idea of a multilevel feedback queue?