Consider the 3 process, P1, P2 and P3 shown in the table.

Process	Arrival Time	Time units Requied
P1	0	5
P2	1	7
P3	3	4

The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are

Keep practicing — related questions

• Three jobs are executed on a single processor system, it arrives at 0 time in order of p, q, r. Their CPU b...
• which one of following are scheduling algorithm
• A process can be swapped out from the memory, if i. its time quanta has expired in Round-robin scheduling i...
• Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match the entries i...
• Consider a system with 4 types of resources R1 (3 units), R2 (2 units), R3 (3 units), R4 (2 units). A non-p...
• Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match the entries i...
• In a certain code, MARIGOLD is written as 5@0%9$7& and PLAINT is written as 6?@%3+. How will TAMPON be writ...
• What will be the output of the program? class Test { public static void main(String [] args) { int x= 0; in...