Match List - I with List - II.

(D) Priority Scheduling (IV) Select the process for execution with 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; SJF picks the smallest next burst; round robin gives each process a time slice; priority scheduling uses assigned priorities.
More System Software and Operating System questions
- Match List - I with List - II.
- What is the significance of the Banker's algorithm in terms of resource management?
- The order of steps of Address Translation in Linux Virtual Memory Scheme will be : A. register B. offset C. Page directory. D. Page table E…
- Match List-I with List-II :
- Match List-I with List-II.
- Match List-I with List-II :