QuizzesSJF & SRTF Scheduling — Concept Check
intermediate
operating-systems

SJF & SRTF Scheduling — Concept Check

Questions on SJF & SRTF Scheduling. Shortest Job First (SJF) minimizes average waiting time by running the shortest process next, while its preemptive variant SRTF can interrupt a running process when a shorter job arrives.

8 minutes 8 questions Pass at 70%
Time Limit
8 minutes - timer starts when you begin
Change Answers Freely
Revisit and change any answer before submitting
Full Review After Submit
Correct answers and explanations shown for every question
Auto-submit on timeout
Quiz submits automatically when time runs out

Questions in this quiz

8 questions on SJF & SRTF Scheduling — Concept Check. Work through them here, then start the quiz to answer them and see your score.

  1. 1.A system is running SJF scheduling with processes arriving at different times. Process P1 has a burst time of 6ms and arrives first. Process P2 arrives next with a burst time of 2ms. What happens when P2 arrives?

    • ABoth run simultaneously
    • BP2 preempts P1 immediately
    • CP2 waits until P1 finishes
    • DP1 continues running until completion
  2. 2.In an SRTF scheduling system, a process P1 with 5ms remaining is running. A new process P2 arrives with a burst time of 3ms. What happens?

    • AP2 waits for P1 to finish
    • BBoth run simultaneously
    • CP2 preempts P1
    • DP1 continues running
  3. 3.A system using SJF scheduling has processes with burst times: P1=8ms, P2=4ms, P3=1ms. In what order will they execute?

    • AP1, P2, P3
    • BP3, P2, P1
    • CP2, P1, P3
    • DP3, P1, P2
  4. 4.Under SRTF scheduling, which scenario is likely to cause high context switching overhead?

    • AFrequent arrival of short processes
    • BNo new process arrivals
    • CProcesses with identical burst times
    • DLong processes with equal burst times
  5. 5.A system predicts burst times using exponential averaging with α=0.5. If the last burst was 10ms and the previous prediction was 8ms, what is the new prediction?

    • A9ms
    • B7ms
    • C8ms
    • D10ms
  6. 6.What is a common issue with SJF scheduling in real-world scenarios?

    • AIt guarantees no starvation
    • BIt requires no context switches
    • CIt always causes deadlock
    • DIt cannot predict burst times accurately
  7. 7.A process with a long burst time is consistently delayed in an SJF system. What is this phenomenon called?

    • ADeadlock
    • BStarvation
    • CLivelock
    • DPreemption
  8. 8.Which scheduling algorithm is guaranteed to minimize average waiting time among all non-preemptive algorithms?

    • AFCFS
    • BPriority Scheduling
    • CRound Robin
    • DSJF