©FYNDLAY 2024/2025 ALL RIGHTS RESERVED.
COS3721 Chapter 5 Exam Questions And
Answers 100% Verified And Updated.
1. Which of the following is true of cooperative scheduling?
A) It requires a timer.
B) A process keeps the CPU until it releases the CPU either by terminating or by switching to the
waiting state.
C) It incurs a cost associated with access to shared data.
D) A process switches from the running state to the ready state when an interrupt occurs. -
Answer✔B
2. ____ is the number of processes that are completed per time unit.
A) CPU utilization
B) Response time
C) Turnaround time
D) Throughput - Answer✔D
3. ____ scheduling is approximated by predicting the next CPU burst with an exponential
average of the measured lengths of
previous CPU bursts.
A) Multilevel queue
B) RR
C) FCFS
D) SJF - Answer✔D
4. The ____ scheduling algorithm is designed especially for time-sharing systems.
A) SJF
B) FCFS
C) RR
1|Page
, ©FYNDLAY 2024/2025 ALL RIGHTS RESERVED.
D) Multilevel queue - Answer✔C
5. Which of the following scheduling algorithms must be nonpreemptive?
A) SJF
B) RR
C) FCFS
D) priority algorithms - Answer✔C
6. Which of the following is true of multilevel queue scheduling?
A) Processes can move between queues.
B) Each queue has its own scheduling algorithm.
C) A queue cannot have absolute priority over lower-priority queues.
D) It is the most general CPU-scheduling algorithm. - Answer✔B
7. The default scheduling class for a process in Solaris is ____.
A) time sharing
B) system
C) interactive
D) real-time - Answer✔A
8. Which of the following statements are false with regards to the Linux CFS scheduler?
A) Each task is assigned a proportion of CPU processing time.
B) Lower numeric values indicate higher relative priorities.
C) There is a single, system-wide value of vruntime.
D) The scheduler doesn't directly assign priorities. - Answer✔C
9. The Linux CFS scheduler identifies _____________ as the interval of time during which
every runnable task should run at least
once.
A) virtual run time
B) targeted latency
C) nice value
D) load balancing - Answer✔B
10. In Little's formula, λ, represents the ____.
2|Page
COS3721 Chapter 5 Exam Questions And
Answers 100% Verified And Updated.
1. Which of the following is true of cooperative scheduling?
A) It requires a timer.
B) A process keeps the CPU until it releases the CPU either by terminating or by switching to the
waiting state.
C) It incurs a cost associated with access to shared data.
D) A process switches from the running state to the ready state when an interrupt occurs. -
Answer✔B
2. ____ is the number of processes that are completed per time unit.
A) CPU utilization
B) Response time
C) Turnaround time
D) Throughput - Answer✔D
3. ____ scheduling is approximated by predicting the next CPU burst with an exponential
average of the measured lengths of
previous CPU bursts.
A) Multilevel queue
B) RR
C) FCFS
D) SJF - Answer✔D
4. The ____ scheduling algorithm is designed especially for time-sharing systems.
A) SJF
B) FCFS
C) RR
1|Page
, ©FYNDLAY 2024/2025 ALL RIGHTS RESERVED.
D) Multilevel queue - Answer✔C
5. Which of the following scheduling algorithms must be nonpreemptive?
A) SJF
B) RR
C) FCFS
D) priority algorithms - Answer✔C
6. Which of the following is true of multilevel queue scheduling?
A) Processes can move between queues.
B) Each queue has its own scheduling algorithm.
C) A queue cannot have absolute priority over lower-priority queues.
D) It is the most general CPU-scheduling algorithm. - Answer✔B
7. The default scheduling class for a process in Solaris is ____.
A) time sharing
B) system
C) interactive
D) real-time - Answer✔A
8. Which of the following statements are false with regards to the Linux CFS scheduler?
A) Each task is assigned a proportion of CPU processing time.
B) Lower numeric values indicate higher relative priorities.
C) There is a single, system-wide value of vruntime.
D) The scheduler doesn't directly assign priorities. - Answer✔C
9. The Linux CFS scheduler identifies _____________ as the interval of time during which
every runnable task should run at least
once.
A) virtual run time
B) targeted latency
C) nice value
D) load balancing - Answer✔B
10. In Little's formula, λ, represents the ____.
2|Page
