ISRO2009-10

Question

The correct matching of the following pairs is

$\begin{array}{|l|l|l|l|} \hline  \text{A.} & \text{Disk check} & \text{i.} & \text{Round robin} \\\hline \text{B.}& \text{Batch processing} & \text{ii.} & \text{Scan} \\\hline \text{C.} & \text{Time sharing} & \text{iii.} & \text{LIFO} \\\hline \text{D.} & \text{Stack operation} & \text{iv.} & \text{FIFO} \\\hline \end{array}$

1. a-iii, b-iv, c-ii, d-i
2. a-iv, b-iii, c-ii, d-i
3. a-iii, b-iv, c-i, d-ii
4. a-ii, b-iv, c-i, d-iii

Answer 1

Answer is D:

Disk check - Scan Algorithms

Batch processing -  jobs should process in First in First out manner

Time sharing  - Round robin based on time slice time sharing will happen

Stack operation - Last In Last Out 

Comments

@naga praveen

Stack operation===> last in first out (please edit your solution)

Answer 2

option d) should be the ans. :)

Answer 3

I would like to answer by elimination procedure

the stack is well-known as LIFO order so the answer is D

 

(Time-sharing means all process gets equal time so Round Robin)