The correct matching for the following pairs is (A) Disk Scheduling (1) Round…
1997
The correct matching for the following pairs is
(A) Disk Scheduling (1) Round robin
(B) Batch Processing (2) SCAN
(C) Time sharing (3) LIFO
(D) Interrupt processing (4) FIFOAnswer: C. A - 2 B - 4 C - 1 D - 3 — By matching the core Operating System concepts to their respective algorithms/structures: (A) Disk Scheduling ⟶ (2) SCAN: SCAN (also known as the elevator…
- A.
A - 3
B - 4
C - 2
D - 1
- B.
A - 4
B - 3
C - 2
D - 1
- C.
A - 2
B - 4
C - 1
D - 3
- D.
A - 3
B - 4
C - 3
D - 2
Attempted by 3 students.
Show answer & explanation
Correct answer: C
By matching the core Operating System concepts to their respective algorithms/structures:
(A) Disk Scheduling ⟶ (2) SCAN: SCAN (also known as the elevator algorithm) is a classic disk scheduling algorithm used to determine the order in which data head requests are serviced.
(B) Batch Processing ⟶ (4) FIFO: Early batch processing systems executed jobs non-preemptively in the exact order they arrived, which is First-In, First-Out (FIFO).
(C) Time sharing ⟶ (1) Round robin: Time-sharing systems give each process a small, equal slice of CPU time (quantum) in a rotating order, which is the definition of Round-robin scheduling.
(D) Interrupt processing ⟶ (3) LIFO: When an interrupt occurs, the current CPU state is pushed onto a stack (Last-In, First-Out) so the system can handle the interrupt and later resume the original task from the exact same spot.
Matching these gives: A-2, B-4, C-1, D-3, which corresponds to code c.