1
GATE CSE 2011
+2
-0.6
Consider the following table of arrival time and burst time for three processes $$P0,P1$$ and $$P2$$.
Process Arrival Time Burst Time
P0 0 ms 9 ms
P1 1 ms 4 ms
P2 2 ms 9 ms

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only a arrival or completion of processes. What is the average waiting time for the three processes?

A
$$5.0$$ $$ms$$
B
$$4.33$$ $$ms$$
C
$$6.33$$ $$ms$$
D
$$7.33$$ $$ms$$
2
GATE CSE 2009
+2
-0.6
In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state:

Now consider the following statements:
$$1.\,\,\,$$ If a process makes a transition $$D,$$ it would result in another process making transition $$A$$ immediately.
$$2.\,\,\,$$ $$A$$ process $${P_2}$$ in blocked state can make transition $$E$$ while another process $${P_1}$$ is in running state.
$$3.\,\,\,$$ The $$OS$$ uses preemptive scheduling.
$$4.\,\,\,$$ The $$OS$$ uses non-preemptive scheduling. Which of the above statements are TRUE?

A
$$1$$ and $$2$$
B
$$1$$ and $$3$$
C
$$2$$ and $$3$$
D
$$2$$ and $$4$$
3
GATE CSE 2008
+2
-0.6
A process executes the following code
for (i = 0; i < n; i + +) fork ( ); 
The total number of child processes created is
A
$$n$$
B
$${2^n} - 1$$
C
$${2^n}$$
D
$${2^{n + 1}} - 1$$
4
GATE CSE 2008
+2
-0.6
Which of the following is/are true of the auto-increment addressing mode?
$${\rm I}.\,\,\,$$ It is useful in creating self-relocating code
$${\rm II}.\,\,\,$$ If it is included in an Instruction Set Architecture, then an additional $$ALU$$ is required for effective address calculation.
$${\rm III}.\,\,\,$$ The amount of increment depends on the size of the data item accessed
A
$${\rm I}$$ only
B
$${\rm II}$$ only
C
$${\rm III}$$ only
D
$${\rm II}$$ & $${\rm III}$$ only
GATE CSE Subjects
EXAM MAP
Medical
NEET