Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0,2,6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignored

Consider three CPU intensive processes, which require 10, 20, 30 units

1.	Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0,2,6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignored
A.	1
B.	2
C.	3
D.	4
Answer» D. 4

Discussion

No Comment Found

Related MCQs

A process executes the following segment of code:for(i=1;i<=n;i++) fork() :The number of new processes created is:
Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0,2,6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignored
A thread is also called:
Assuming that the system call fork () never fails, consider the following C programs P1 and P2 executed on a UNIX / Linux system:/*P1*/Int main() {fork ():fork () ;fork () ;Printf(“Happy\n”);}/*P2*/Int main() {fork ();Printf(“Happy\n”);fork ()Printf(“Happy\n”);fork () ;Printf(“Happy\n”);} Statement I: P1 displays "Happy" 8 times.Statement II: P2 displays "Happy" 12 times.In the light of the above statements, choose the correct answer from the options given below
Process is:
Dispatch latency is defined as
Consider the following statements about process state transitions for a system using preemptive scheduling.I. A running process can move to ready state.II. A ready process can move to running state.III. A blocked process can move to running state.IV. A blocked process can move to ready state.Which of the above statements are TRUE?
Copying a process from memory to disk to allow space for other processes is called _________.
In which of the following state, the process is waiting for processor ?
A process execute the following code:For (I = 1; I ≤ n; I ++) fork ();How many child processes are created?

Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0,2,6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignored

Discussion

No Comment Found

Related MCQs

Reply to Comment