Question

Match List-I with List-II.

List-I	List-II
A. Shortest First Served Scheduling	I. CPU is allocated to the process with the highest priority
B. Shortest Job First Scheduling	II. The process that requests the CPU first is allocated the CPU first
C. Priority Scheduling	III. The algorithm associates with each process the length of the next CPU burst
D. Round-Robin Scheduling	IV. A pre-emption is added to switch between processes

Choose the correct answer from the options given below:

• A. A-II, B-III, C-I, D-IV
• B. A-III, B-II, C-I, D-IV
• C. A-II, B-III, C-IV, D-I
• D. A-III, B-I, C-II, D-IV

Hint:

Remember: SJF → shortest burst, Priority → importance, Round Robin → time sharing.

Answer 1

The Correct Option is A

Concept: Different CPU scheduling algorithms assign CPU based on different criteria.

Step 1: Match A. Shortest First Served is similar to First Come First Serve: \[ \Rightarrow \text{CPU allocated to first requester} \] \[ A \rightarrow II \]

Step 2: Match B. Shortest Job First: \[ \Rightarrow \text{based on CPU burst time} \] \[ B \rightarrow III \]

Step 3: Match C. Priority Scheduling: \[ \Rightarrow \text{highest priority first} \] \[ C \rightarrow I \]

Step 4: Match D. Round Robin: \[ \Rightarrow \text{time slicing (preemption)} \] \[ D \rightarrow IV \]

Step 5: Final mapping. \[ A-II,\ B-III,\ C-I,\ D-IV \] \[ \boxed{(1)} \]