A) Dispatcher
B) Interrupt
C) Scheduler
D) None of these
A) Dispatcher
B) Interrupt
C) Scheduler
D) None of these
A) Job queue
B) Ready queue
C) Execution queue
D) Process queue
A) Waiting time
B) Turnaround time
C) Response time
D) Throughput
A) First-come first-served scheduling
B) Shortest job scheduling
C) Priority scheduling
D) None of these
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
A) All process
B) Currently running process
C) Parent process
D) Init process
A) Shortest job scheduling algorithm
B) Round robin scheduling algorithm
C) Priority scheduling algorithm
D) Multilevel queue 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
A) Kernel level thread
B) User level thread
C) Process
D) None of the mentioned