Telegram group: T.me/BBCNOUN
[CIT211] In the following cases non – preemptive scheduling occurs :
When a process goes from the running state to the waiting state

[CIT211] Scheduling is :
all of the options

[CIT211] Round robin scheduling falls under the category of :
Preemptive scheduling

[CIT211] With round robin scheduling algorithm in a time shared system,
using very large time slices converts it into First come First served scheduling algorithm

[CIT211] The portion of the process scheduler in an operating system that dispatches processes is concerned with :
assigning ready processes to CPU

[CIT211] The switching of the CPU from one process or thread to another is called :
all of the options

[CIT211] An I/O bound program will typically have :
many very short CPU bursts

[CIT211] The strategy of making processes that are logically runnable to be temporarily suspended is called :
Preemptive scheduling

[CIT211] A process is selected from the ______ queue by the ________ scheduler, to be executed.
wait, long term

[CIT211] The FIFO algorithm :
first executes the job that came in first in the queue