COMPUTER SOFTWARE
OPERATING SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following best describes the ‘shortest job first’ scheduling algorithm?
|
|
Processes that are estimated to have the shortest execution time are run first although they may return to the ready queue before completion if a shorter job arrives
|
|
|
Processes that are estimated to have the shortest execution time are run first but can be returned to the ready queue by time slicing
|
|
|
Processes are executed in the order they arrive in the ready queue
|
|
|
Processes that are estimated to have the shortest execution time are run first until they are complete
|
Explanation:
Detailed explanation-1: -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. This is commonly used for a task queue, for example as illustrated in this section.
Detailed explanation-2: -Preemptive SJF: It is also known as shortest remaining time first scheduling.
There is 1 question to complete.