Match the following : \(\begin{array}{clcl} & \textbf{List – I} &&…
2014
Match the following :
\(\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a}. & \text{Multilevel feedback queue} & \text{i.} & \text{Time-slicing} \\ \text{b.} & \text{FCFS} & \text{ii.} & \text{Criteria to move processes} \\ &&& \text{between queues} \\ \text{c.} & \text{Shortest Process next} & \text{iii.} & \text{Batch Processing} \\ \text{d.} & \text{Round robin scheduling} & \text{iv.} & \text{Exponential smoothening} \\ \end{array}\)
Codes :
- A.
a-i; b-iii; c-ii; d-iv
- B.
a-iv; b-iii; c-ii; d-i
- C.
a-iii; b-i; c-iv; d-i
- D.
a-ii; b-iii; c-iv; d-i
Attempted by 425 students.
Show answer & explanation
Correct answer: D
Correct matching and brief explanations:
Multilevel feedback queue: Criteria to move processes between queues — this scheduling uses rules to promote or demote processes based on their CPU usage and behavior.
First-Come, First-Served (FCFS): Batch processing — FCFS processes jobs in arrival order without preemption, commonly used for batch workloads.
Shortest Process Next (Shortest Job First): Exponential smoothing — systems often use exponential averaging to predict the next CPU burst length so the shortest predicted job can be selected.
Round robin scheduling: Time-slicing — each process receives a fixed time quantum in a cyclical order, implementing time-slicing.
A video solution is available for this question — log in and enroll to watch it.