MCQs
Total Questions : 36
| Page 2 of 4 pages
Answer: Option B. -> Preemptive scheduling
None.
Answer: Option B. -> first executes the job that came in first in the queue
None.
Answer: Option A. -> are very appropriate for very large computers
Large computers are overloaded with greater number of processes.
Answer: Option A. -> using very large time slices converts it into First come First served scheduling algorithm
All the processes will be able to get completed.
Answer: Option A. -> assigning ready processes to CPU
None.
Answer: Option B. -> Shortened; Lengthened
None.
Answer: Option A. -> dispatcher
None.
Answer: Option B. -> turnaround time
None.
Answer: Option A. -> CPU is allocated to the process with highest priority
None.
Answer: Option B. -> ready queue
None.