A) Dispatcher
B) Interrupt
C) Scheduler
D) None of these
Lecturer Computer Science 2017
The processes that are residing in main memory for execution are kept on a list called?
A) Job queue
B) Ready queue
C) Execution queue
D) Process queue
The interval from the time of submission of a process to the time of completion is termed as?
A) Waiting time
B) Turnaround time
C) Response time
D) Throughput
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
A) First-come first-served scheduling
B) Shortest job scheduling
C) Priority scheduling
D) None of these
In priority scheduling algorithm ……?
A) CPU is allocated to the process with highest priority
B) CPU is allocated to the process with lowest priority
C) Equal priority processes, cannot be scheduled
D) None of these
Advertisements
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of?
A) All process
B) Currently running process
C) Parent process
D) Init process
Which algorithm is defined in Time quantum?
A) Shortest job scheduling algorithm
B) Round robin scheduling algorithm
C) Priority scheduling algorithm
D) Multilevel queue scheduling algorithm
In multilevel feedback scheduling algorithm?
A) Process can move to a different classified ready queue
B) Classification of ready queue is permanent
C) Processes are not classified into groups
D) None of the mentioned
Which one of the following can not be scheduled by the kernel?
A) Kernel level thread
B) User level thread
C) Process
D) None of the mentioned