M

Mr. Dubey • 52.26K Points
Coach 

Q. With round robin scheduling algorithm in a time shared system

(A) using very large time slices converts it into first come first served scheduling algorithm
(B) using very small time slices converts it into first come first served scheduling algorithm
(C) using extremely small time slices increases performance
(D) using very small time slices converts it into shortest job first algorithm
Correct : Option (A)

Explanation: 
 all the processes will be able to get completed.

Share

Previous

Next

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following is an example of dynamic programming approach?

Q. PDDL stands for_________________________

Q. Which method displays the custom control?

Q. Consider the following grammars (S1) : A --> aBCD B --> bc|c C --> d|∈ D -> b (S2) : A --> aBCD B --> bc|∈ C --> d|c D

Q. ______ is used as an intermediate to extend the processor BUS.

Q. An operating system version designed for use with a tablet PC is Microsoft Windows XP

Q. ___________ employs the supervised mode of learning.

Q. When a RAM module passes the checker board test it is

Q. The number of attributes in relation is called as its

Q. The graph defined by the vertices and edges of a __________ is bipartite.