OPERATING SYSTEMS FOR COMPUTERS
COMPUTER OPERATING SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
round robin
|
|
|
shortest remaining time
|
|
|
shortest job first
|
|
|
first come first served
|
Detailed explanation-1: -In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment.
Detailed explanation-2: -Time quantum is defined in round robin scheduling algorithm. Explanation: The period of time for which a process is allowed to run in a pre-emptive multitasking system is generally called the time slice or quantum.
Detailed explanation-3: -First in, first out (FIFO), also known as first come, first served (FCFS), is the simplest scheduling algorithm. FIFO simply queues processes in the order that they arrive in the ready queue.
Detailed explanation-4: -Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive).