Question 10880 – GATE 2006-IT
January 25, 2024
Question 5210 – Data-Structures
January 25, 2024
Question 10880 – GATE 2006-IT
January 25, 2024
Question 5210 – Data-Structures
January 25, 2024

Operating-Systems

Question 16

Which scheduling policy is most suitable for a time shared operating system?

A
Shortest Job First
B
Round Robin
C
First Come First Serve
D
Elevator
Question 16 Explanation: 
In Round robin, we use the time quantum based on this execution can be done. Then it is said to be time shared operating system.
Correct Answer: B
Question 16 Explanation: 
In Round robin, we use the time quantum based on this execution can be done. Then it is said to be time shared operating system.

Leave a Reply

Your email address will not be published. Required fields are marked *