1. 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 the mentioned
Explanation: first-come, first-served scheduling
2. 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 can not be scheduled
d) None of the mentioned
Explanation: In priority scheduling algorithm, CPU is allocated to the process with highest priority
3. 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
Explanation: In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of currently running process
4. 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
Explanation: round robin scheduling algorithm
5. Process are classified into different groups in ____________
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Explanation: Process are classified into different groups in multilevel queue scheduling algorithm
6. In multilevel feedback 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
Explanation: In multilevel feedback scheduling algorithm, a process can move to a different classified ready queue
7. 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
Explanation: User level threads are managed by thread library and the kernel is unaware of them.
8. CPU scheduling is the basis of ___________
a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
d) none of the mentioned
Explanation: CPU scheduling is the basis of multiprogramming operating systems
9. With multiprogramming ______ is used productively.
a) time
b) space
c) money
d) all of the mentioned
Explanation: Time
10. What are the two steps of a process execution?
a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst
Explanation: CPU & I/O Burst