← 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 →- Q1. Turnaround time is:
- Q2. Which algorithm gives the minimum average waiting time among non-preemptive schedulers?
- Q3. A long CPU-bound process at the front makes many short processes wait. This is the:
- Q4. P1 (arrival 0, burst 4) and P2 (arrival 1, burst 2), FCFS. What is P2's waiting time?
- Q5. What happens if the Round Robin time quantum is very large?
- Q6. Which of these scheduling algorithms is preemptive?
- Q7. With SRTF, P1 arrives at 0 with burst 6 and P2 arrives at 2 with burst 2. What is P1's waiting time?
- 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?
- Q9. How does aging solve starvation in priority scheduling?
- Q10. What is the main idea of a multilevel feedback queue?