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 2011
+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
+2
-0.6
Consider the following recursive C function that takes two arguments:
unsigned int foo (unsigned int n, unsigned int r) {
if (n > 0) return((n % r) + foo(n/r, r));
else return 0;
}
What is the return value of the function foo when it is called as foo (513, 2)?
A
9
B
8
C
5
D
2
4
GATE CSE 2011
+2
-0.6
Consider the following recursive C function that takes two arguments:
unsigned int foo (unsigned int n, unsigned int r) {
if (n > 0) return((n % r) + foo(n/r, r));
else return 0;
}
What is the return value of the function foo when it is called as foo (345, 10)?
A
345
B
12
C
5
D
3
GATE CSE Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Medical
NEET