A. shortest job scheduling algorithm B. round robin scheduling algorithm C. priority scheduling algorithm D. multilevel queue scheduling algorithm
A. 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
A. multiprocessor systems B. multiprogramming operating systems C. larger memory sized systems D. none of the mentioned
A. time B. space C. money D. all of the mentioned
A. I/O & OS Burst B. CPU & I/O Burst C. Memory & I/O Burst D. OS & Memory Burst
A. blocked, short term B. wait, long term C. ready, short term D. ready, long term
A. When a process switches from the running state to the ready state B. When a process goes from the running state to the waiting state C. When a process switches from the waiting state to the ready state D. All of the mentioned
A. process switch B. task switch C. context switch D. all of the mentioned