1
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
If two fair coins are flipped and at least one of the outcomes is known to be a head, what is the probability that both outcomes are heads?
A
1/3
B
$${\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 4$}}$$
C
$${\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 2$}}$$
D
2/3
2
GATE CSE 2011
MCQ (Single Correct Answer)
+2
-0.6
An application loads $$100$$ libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to random location is given as $$10$$ $$ms$$. Rotational speed of disk is $$6000$$ $$rpm.$$ If all $$100$$ libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected).
A
$$0.50s$$
B
$$1.50s$$
C
$$1.25s$$
D
$$1.00s$$
3
GATE CSE 2011
MCQ (Single Correct Answer)
+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$$
4
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
Let the time taken to switch between user and kernel modes of execution be $${t_1}$$ while the time taken to switch between two processes be $${t_2}$$.

Which of the following is TRUE?

A
$${t_1} > {t_2}$$
B
$${t_1} = {t_2}$$
C
$${t_1} < {t_2}$$
D
Nothing can be said about the relation between $${t_1}$$ and $${t_2}.$$