(A) Address Binding
(B) Loading
(C) Compiling
(D) Execution
Updated on 08/12/2021
Related Posts 👇
-
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
-
What is scheduling?
(A) Making proper use of processor
(B) Allowing a job to use the processor
(C) Both of the above
(D) None of the aboveUpdated on 19/08/2022
-
Processes that are residing in main memory and are ready and waiting to execute are kept on a list called?
(A) Execution queue
(B) Ready queue
(C) Job queue
(D) Process queueUpdated on 19/08/2022
-
Which module gives control of the CPU to the process selected by the short term scheduler?
(A) Scheduler
(B) Interrupt
(C) Dispatcher
(D) None of the aboveUpdated on 19/08/2022
-
Disadvantage of a process being allocated all its resources before beginning its execution is?
(A) Very high resource utilization
(B) Low CPU utilization
(C) Low resource utilization
(D) None of the aboveUpdated on 19/08/2022
-
For sharable resources mutual exclusion?
(A) is required
(B) is not required
(C) may be or may not be required
(D) None of the aboveUpdated on 19/08/2022