retagged by
5,636 views
24 votes
24 votes

The correct matching for the following pairs is:$$\small \begin{array}{cl|cl}\hline \text{(A)} &\text{Disk Scheduling}  &  \text{(1)} &\text{Round robin}  \\\hline 
\text{(B)} &\text{Batch Processing} & \text{(2)} &\text{SCAN} \\\hline 
\text{(C)} & \text{Time-sharing} & \text{(3)}&\text {LIFO} \\\hline 
\text{(D)} &\text{Interrupt processing} & \text{(4)} &\text{FIFO} \\\hline \end{array}$$

  1. $\text{A-3 B-4 C-2 D-1}$

  2. $\text{A-4 B-3 C-2 D-1}$

  3. $\text{A-2 B-4 C-1 D-3}$

  4. $\text{A-3 B-4 C-3 D-2}$

retagged by

3 Answers

Best answer
48 votes
48 votes

(C) is answer. Interrupt processing is LIFO because when we are processing an interrupt, we disable the interrupts originating from lower priority devices so lower priority interrupts can not be raised. If an interrupt is detected then it means that it has higher priority than currently executing interrupt so this new interrupt will preempt the current interrupt so, LIFO. Other matches are easy

edited by
9 votes
9 votes
Answer: C
2 votes
2 votes
Scan algorithm is under Disk scheduling.

Interrupt processing is based on LIFO.

Time-sharing is related to CPU scheduling which is under the Round robin algorithm.

Batch processing is based on FIFO.

SO ANSWER (C)
Answer:

Related questions

16 votes
16 votes
3 answers
1
Kathleen asked Sep 29, 2014
7,556 views
The correct matching for the following pairs is:$$\begin{array}{ll} \text{(A) DMA I/O} & \text{(1) High speed RAM} \\ \text{(B) Cache} & \text{(2) Disk} \\ \text{(C) I...
21 votes
21 votes
3 answers
2
Kathleen asked Sep 29, 2014
4,973 views
The correct matching for the following pairs is$$\begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \...
50 votes
50 votes
13 answers
3
25 votes
25 votes
6 answers
4
Kathleen asked Sep 29, 2014
17,437 views
An operating system contains $3$ user processes each requiring $2$ units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is$3$$...