COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
shortest job scheduling algorithm
|
|
|
round robin scheduling algorithm
|
|
|
priority scheduling algorithm
|
|
|
multilevel queue scheduling algorithm
|
Detailed explanation-1: -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-2: -Abstract: 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-3: -Round Robin (RR) The simplest preemptive scheduling algorithm is round-robin, in which the processes are given turns at running, one after the other in a repeating sequence, and each one is preempted when it has used up its time slice.
Detailed explanation-4: -Round Robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum. Once a process is executed for a given time period, it is preempted and other process executes for a given time period.
Detailed explanation-5: -Round Robin (RR) Algorithm: It uses concept of time slice or time quantum. Process at the beginning of ready queue gets chance to be executed first but only for span of one-time quantum.