Process scheduling: FCFS, SJF, and RR

What this quiz covers

FCFS, SJF (preemptive and non-preemptive), and Round Robin show up everywhere in Operating Systems - especially when you need to compute waiting time, turnaround time, and response time from a process table.

Each question is multiple-choice with 4 options and no timer, so you can focus on careful calculations rather than rushing.

Skills you’ll practice

You’ll practice building Gantt charts, handling arrivals and context switches, and comparing how different policies affect fairness and throughput.

Mixed difficulty is balanced by starting with straightforward scheduling traces and gradually adding edge cases like ties, idle CPU gaps, and quantum-related nuances.

Common pitfalls to avoid

• Mixing up waiting time vs turnaround time vs response time
• Forgetting to account for CPU idle periods when no process has arrived
• Handling SJF ties inconsistently (tie-breakers can change the schedule)
• Applying Round Robin quantum incorrectly when a burst finishes mid-quantum
• Confusing preemptive SJF (SRTF) with non-preemptive SJF

Choosing length and difficulty

Pick the question count you want before starting if you’re doing a quick review or a full practice run, and select a difficulty setting to match your comfort level.

If you’re revising for exams, try a longer run on mixed difficulty; for interview prep, focus on harder questions that emphasize tricky timelines and metric calculations.