(A) Rotational time+Transfer time
(B) Seek time+Transfer Time
(C) Seek Time+Rotational time
(D) Seek time+Rotational time+Transfer time
Updated on 29/03/2022
Related Posts 👇
-
Scheduling is done so as to?
(A) Keep the waiting time the same
(B) Increase the waiting time
(C) Decrease the waiting time
(D) None of the aboveUpdated on 05/09/2022
-
In priority scheduling algorithms when a process arrives at the ready queue its priority is compared with the priority of?
(A) Currently running processes
(B) All processes
(C) Init processes
(D) Parent processesUpdated on 05/09/2022
-
CPU scheduling is the basis of?
(A) Larger memory sized systems
(B) Multiprogramming operating systems
(C) Multiprocessor systems
(D) None of the aboveUpdated on 05/09/2022
-
In priority scheduling algorithm?
(A) CPU is allocated to the process with lowest priority
(B) CPU is allocated to the process with highest priority
(C) Both of the above
(D) None of the aboveUpdated on 05/09/2022
-
Process are classified into different groups in?
(A) Priority scheduling algorithm
(B) Shortest job scheduling algorithm
(C) Multilevel queue scheduling algorithm
(D) Round robin scheduling algorithmUpdated on 05/09/2022
-
An I/O bound program will typically have?
(A) Many very short I/O bursts
(B) A few very short CPU bursts
(C) Many very short CPU bursts
(D) A few very short I/O burstsUpdated on 19/08/2022
-
Time quantum is defined in?
(A) Priority queue scheduling algorithm
(B) Round Robin scheduling algorithm
(C) Shortest job first scheduling algorithm
(D) None of the aboveUpdated on 19/08/2022
-
Which among following can not be scheduled by the kernel?
(A) Process
(B) User level thread
(C) Kernel level thread
(D) None of the aboveUpdated on 19/08/2022