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?

What does the following fragment of C-program print?

char c[ ] = "GATE2011";
char *p = c;
printf("%s", p + p[3] - p[1]);

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)?

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)?