Explain a process scheduling algorithm
Filed under Deutsche Bank
Free read 3 of 3The scheduler picks which ready process gets the CPU, to maximise utilisation and throughput while minimising waiting and response time.
The question
Explain a process (CPU) scheduling algorithm: the candidate was asked about scheduling algorithms and to explain any one of them.
Approach
The scheduler picks which ready process gets the CPU, to maximise utilisation and throughput while minimising waiting and response time.
Processes form a ready queue; each runs for a time quantum, then is preempted and moved to the back. It is fair and has good response time.
Burst times P1=5, P2=3, P3=2 with quantum 2: order P1, P2, P3, P1, P2, P1 and completion times are 10, 9 and 6 for P1, P2 and P3 respectively.
FCFS is simple but has a convoy effect; SJF minimises average waiting but can starve long jobs; priority scheduling uses aging to prevent starvation.
Tips
- What they are testing: Understanding of how an OS decides which process runs next, with an example.
- Common mistake: Describing only the name or rule without showing waiting time or an example.
Related Deutsche Bank questions
Collected from public candidate posts and coding forums. Updated Nov 2026.