1. Which module gives control of the CPU to the process selected by the short-term scheduler?
- dispatcher
- interrupt
- scheduler
- none of the above
2. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called :
- job queue
- ready queue
- execution queue
- process queue
3. The interval from the time of submission of a process to the time of completion is termed as :
- waiting time
- turnaround time
- response time
- throughput
4. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
- first-come, first-served scheduling
- shortest job scheduling
- priority scheduling
- none of the above
5. In priority scheduling algorithm :
- CPU is allocated to the process with highest priority
- CPU is allocated to the process with lowest priority
- Equal priority processes can not be scheduled
- None of the mentioned
6. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of :
- all process
- currently running process
- parent process
- init process
7. Which algorithm is defined in Time quantum?
- shortest job scheduling algorithm
- round robin scheduling algorithm
- priority scheduling algorithm
- multilevel queue scheduling algorithm
8. Process are classified into different groups in :
- shortest job scheduling algorithm
- round robin scheduling algorithm
- priority scheduling algorithm
- multilevel queue scheduling algorithm
9. In multilevel feedback scheduling algorithm :
- a process can move to a different classified ready queue
- classification of ready queue is permanent
- processes are not classified into groups
- none of the mentioned
10. Which one of the following can not be scheduled by the kernel?
- kernel level thread
- user level thread
- process
- none of the mentioned