1. Time sharing
provides
(a) Disk management
(b) File system management
(c) Concurrent
execution
(d) All of the above
Ans.: C
2. A process executes
the following code:
for (i=0; i<n;
i++)
fork();
The total number of
child processes created is
(a) n
(b) 2n – 1
(c) 2n
(d) 2n+1 – 1
Ans.: B
3. The performance of
Round Robin algorithm depends heavily on
(a) Size of the
process
(b) The i/o bursts of the process
(c) The CPU burst of
the process
(d) The size of the
time quantum
Ans.: D
