CPU Scheduling
This section of our 1000+ Operating System MCQs focuses on cpu scheduling in Operating System.
1. Which module gives control of the CPU to the process selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned
Answer:a
Explanation:None.
Explanation:None.
2. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
a) job queue
b) ready queue
c) execution queue
d) process queue
a) job queue
b) ready queue
c) execution queue
d) process queue
3. 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
a) waiting time
b) turnaround time
c) response time
d) throughput
Answer:b
Explanation:None.
Explanation:None.
4. Which scheduling algorithm allocates the CPU first to the process that requeststhe CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
Answer:a
Explanation:None.
Explanation:None.
5. 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
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
Answer:a
Explanation:None.
Explanation:None.
6. 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
a) all process
b) currently running process
c) parent process
d) init process
Answer:b
Explanation:None.
Explanation:None.
7. Time quantum is defined in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Answer:b
Explanation:None.
Explanation:None.
8. 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
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Answer:d
Explanation:None.
Explanation:None.
9. 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
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
Answer:a
Explanation:None.
Explanation:None.
10. 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
a) kernel level thread
b) user level thread
c) process
d) none of the mentioned
Answer:b
Explanation:User level threads are managed by thread library and the kernel in unaware of them.
Explanation:User level threads are managed by thread library and the kernel in unaware of them.
No comments:
Post a Comment