An operating system uses shortest remaining time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:

Process	Execution time	Arrival time
P1	20	0
P2	25	15
P3	10	30
P4	15	45

Keep practicing — related questions

• Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units respe...
• Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units respe...
• Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at time 0, 2 and ...
• Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at time 0, 2 and ...
• Which of the following OS scheduling algorithms provides a fix time for each process to execute?
• Which of the following algorithms represents RTOS(Real Time Operating System) task/process scheduling?
• Consider the following table of arrival time and burst time for three processes P0, P1 and P2. Process Arri...
• Consider the following set of processes, with the arrival time and the CPU-burst time given in milliseconds...