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}$ a-iii, b-iv, c-ii, d-i a-iv, b-iii, c-ii, d-i a-iii, b-iv, c-i, d-ii a-ii, b-iv, c-i, d-iii Operating System isro2009 operating-system process-scheduling + – go_editor asked Jun 14, 2016 retagged Dec 9, 2022 by Lakshman Bhaiya go_editor 2.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 naga praveen answered Jun 24, 2016 selected Jun 24, 2016 by ManojK naga praveen comment Share Follow See 1 comment See all 1 1 comment reply talha hashim commented Nov 3, 2018 reply Follow Share @naga praveen Stack operation===> last in first out (please edit your solution) 0 votes 0 votes Please log in or register to add a comment.
6 votes 6 votes option d) should be the ans. :) Devshree Dubey answered Jun 14, 2016 Devshree Dubey comment Share Follow See all 0 reply Please log in or register to add a comment.
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) saiteja chekka answered Oct 27, 2017 saiteja chekka comment Share Follow See all 0 reply Please log in or register to add a comment.