Which scheduling algorithm gives each process a fixed time slice?
A
FCFS
B
Round Robin
C
Shortest Job First
D
Priority Scheduling
Correct Answer: Option B — Round Robin
Explanation:
Round Robin scheduling assigns a fixed time quantum to each process. If a process does not complete within its allotted time, it is moved to...
Round Robin scheduling assigns a fixed time quantum to each process. If a process does not complete within its allotted time, it is moved to the end of the queue. This approach improves fairness and responsiveness in time-sharing systems.