Skills101
← All practice quizzes

Quiz: CPU Scheduling Numericals

5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass

The harder scheduling questions from GATE and university papers, solved step by step — preemptive and non-preemptive priority, a CPU that sits idle, HRRN, how the Round Robin quantum changes the answer, and context-switch overhead.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    In non-preemptive priority scheduling (1 = highest), P1 (arrival 0, burst 4, pri 3) is running when P2 (arrival 1, pri 1) arrives. What happens at t = 1?

  2. Question 2

    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. Question 3

    In the preemptive priority example, what was P1's waiting time?

  4. Question 4

    At t = 9 in the HRRN example, why was C chosen over E?

  5. Question 5

    What is the response ratio of a process that has waited 6 ms and has a burst of 3 ms?

🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →