Solution

The correct answer is A - III, B - IV, C - II, D - I

Key Points

• A. First Come First Served (FCFS) - III:
  • Processes are executed in the order they arrive. This is a simple scheduling algorithm where the first process to arrive is the first to be executed.
• B. Shortest Job First (SJF) - IV:
  • Selects the process for execution with the smallest next burst time. This algorithm aims to minimize the average waiting time.
• C. Round Robin (RR) - II:
  • Ensures fair allocation of CPU time by assigning a time slice. Each process is given a fixed time to execute, and then the next process is executed.
• D. Priority Scheduling - I:
  • Each process is assigned a priority. The process with the highest priority is executed first.

Therefore, the correct option is A - III, B - IV, C - II, D - I. So, the correct option is 3).