Directions (Q96–100): Consider the following set of processes with arrival time and CPU burst time given in milliseconds (ms):
| Process | Arrival Time | Burst Time |
|---|---|---|
| P1 | 0 | 5 |
| P2 | 2 | 3 |
| P3 | 2 | 2 |
| P4 | 5 | 3 |
| P5 | 6 | 1 |
When we apply the Shortest Job First (SJF) scheduling algorithm, process P2 faces partial starvation and waits a longer time to execute. Which one of the following algorithms addresses this problem?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. Highest Response Ratio Next
Explanation
HRRN uses the ratio (waiting + burst)/burst, so a process's priority rises the longer it waits. This removes SJF's starvation of longer jobs while still favouring short ones.More System Software and Operating System questions
- Which of the following statements are TRUE about mutual exclusion in concurrent programming? (A) Mutual exclusion ensures that only one pro…
- Which of the following statements are TRUE about privileged instructions? (A) They can only be executed by the operating system kernel and…
- Match List I (Algorithms) with List II (Characteristics)List I List II (A) First Come First Served (FCFS) (I) Each process is assigned a pr…
- Match List I (operating system concepts) with List II (characteristics)List I List II (A) Paging (I) Evicts least recently used page (B) LR…
- Which of the following statements are TRUE about the Process Control Block (PCB)? (A) The PCB contains information about the process state,…
- Which of the following is NOT a requirement for the Banker's algorithm to grant a resource request?