1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The optimal page replacement algorithm will select the page that.
A
Has not been used for the longest time in the past.
B
Will not be used for the longest time in the future.
C
Has been used least number of times.
D
Has been used most number of times.
2
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on
A
The size of the blocks, and the size of the address of the blocks.
B
The number of blocks used for the index, and the size of the blocks.
C
The size of the blocks, the number of blocks used for the index, and the size of the address of the blocks.
D
None of the above.
3
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
Which combination of the following features will suffice to characterize an $$OS$$ as a multi-programmed $$OS?$$
$$(a).$$ More than one program may be loaded into main memory at the same time for execution.
$$(b).$$ If a program waits for certain events such as $$I/O$$, another program is immediately scheduled for execution.
$$(c).$$ If the execution of a program terminates, another program is immediately scheduled for execution.
A
$$a$$
B
$$a$$ and $$b$$
C
$$a$$ and $$c$$
D
$$a, b$$ and $$c$$
4
GATE CSE 2002
Subjective
+2
-0
Draw the process state transition diagram of an $$OS$$ in which
(i) each process is in one of the five states: created, ready, running, blocked (i.e. sleep or wait), or terminated, and
(ii) only non-preemptive scheduling is used by the $$OS.$$ Label the transitions appropriately.