Match the LIST-I with LIST-II.
| LIST-I | LIST-II |
|---|---|
| A. Disk Scheduling | I. Round Robin |
| B. Batch Processing | II. SCAN |
| C. Time Sharing | III. LIFO |
| D. Interrupt Processing | IV. FIFO |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. A-II, B-IV, C-I, D-III
Explanation
SCAN (the 'elevator' algorithm) is a classic disk-scheduling technique, so Disk Scheduling pairs with SCAN (II). Early batch-processing systems run submitted jobs strictly in arrival order, i.e. First-In-First-Out, so Batch Processing pairs with FIFO (IV). Time-sharing systems give each process a fixed time slice in rotation, which is Round Robin scheduling, so Time Sharing pairs with Round Robin (I). Interrupts, especially nested ones, are serviced Last-In-First-Out (the most recently raised interrupt is handled first, and control returns to the earlier ones afterward), so Interrupt Processing pairs with LIFO (III). The match is therefore A-II, B-IV, C-I, D-III.More System Software and Operating System questions
- For the reference string: (given that number of frames is 3) 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 for the optimal page replacement algor…
- Which of the following is not an interprocessor communication mechanism in UNIX?
- In disk scheduling example, suppose the disk tracks are numbered from 0 to 49. Head is presently positioned at track 15 and requests for tr…
- Following is not the feature/characteristic of Linked-List allocation of Files in a File system:
- Match List - I with List - II. List - I List - II A. Macros I. Converts high level code to object (Machine) code B. Assembler II. Used for…
- Once the process is allocated CPU and executing, which of the following events could NOT occur? A. The process could issue an I/O request a…