Which scheduling algorithm is preemptive scheduling algorithm?

The interval from the time of submission of a process to the time of completion is termed as _______

In priority scheduling algorithm,

In preemptive priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ______

Time quantum is defined in _______

A process is selected from the ______ queue by the ________ scheduler, to be executed.

One of the disadvantages of the priority scheduling algorithm is that :

Three CPU intensive processes requires 10, 20 and 30 time units and arrive at times 0, 2 and 6 respectively. The operating system implements a shortest remaining time next scheduling algorithm. Considering that the context switches at time zero and at the end are not counted the number of context switches are needed is ______.

On a single processor four jobs are to be executed. At time t = (0) + (jobs arrive in the order of A, B, C, D). The burst CPU time requirements are 4, 1, 8, 1 time units respectively. Under Round Robin Scheduling with the time slice of 1 time unit the completion time of A is ______."

___________ is a technique of improving the priority of process waiting in Queue for CPU allocation.