retagged by
2,519 views
5 votes
5 votes

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
retagged by

3 Answers

Best answer
10 votes
10 votes

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 

selected by
2 votes
2 votes
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)
Answer:

Related questions

9 votes
9 votes
2 answers
2
go_editor asked Jun 13, 2016
5,848 views
The performance of Round Robin algorithm depends heavily onsize of the processthe I/O bursts of the processthe CPU bursts of the processthe size of the time quantum
3 votes
3 votes
3 answers
4
go_editor asked Jun 15, 2016
2,776 views
Process isA program in high level language kept on diskContents of main memoryA program in executionA job in secondary memory