Match List I (Algorithms) with List II (Characteristics)
| List I | List II |
|---|---|
| (A) First Come First Served (FCFS) | (I) Each process is assigned a priority. |
| (B) Shortest Job First (SJF) | (II) Ensures fair allocation of CPU time by assigning a time slice. |
| (C) Round Robin (RR) | (III) Processes are executed in the order they arrive. |
| (D) Priority Scheduling | (IV) Selects the process with the smallest next burst time. |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (A)-(III), (B)-(IV), (C)-(II), (D)-(I)
Explanation
FCFS runs processes in arrival order (III), SJF picks the smallest next burst (IV), round robin gives each process a time slice (II), and priority scheduling assigns priorities (I).More System Software and Operating System questions
- Match List I (operating system concepts) with List II (characteristics)List I List II (A) Paging (I) Evicts least recently used page (B) LR…
- Which of the following statements are TRUE about the Process Control Block (PCB)? (A) The PCB contains information about the process state,…
- Which of the following is NOT a requirement for the Banker's algorithm to grant a resource request?
- Which data structures does the Banker's Algorithm use to maintain the state of available, maximum and allocated resources?
- What is the significance of the Banker's algorithm in terms of resource management?
- What is the primary goal of the Banker's Algorithm?