1|Page
CMPE320 EXAM 2 FINAL EXAM
TEST REAL EXAM 2025 LATEST
UPDATE 2025 EXAM QUESTIONS
AND CORRECT ANSWERS
Which of the following is true of cooperative scheduling?
A. It requires a timer
,2|Page
B. A process keeps the CPU until it releases the CPU
either by terminating or by switching to a waiting state
C. It incurs a cost associated with access to shared data
D. A process switches from running state to the ready
state when an interrupt occurs.
B. A process keeps the CPU until it releases the CPU
either by terminating or by switching to a waiting state.
___ is the number of processes that are completed per
time unit.
A. CPU Utilization
B. Response Time
C. Turnaround Time
D. Throughput
D. Throughput
___ 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
,3|Page
C. FCFS
D. SJF D. SJF
The ___ scheduling algorithm is designed especially for
time-sharing systems.
A. SJF
B. FCFS
C. RR
D. Multilevel queue
C. RR
Which of the following scheduling algorithms must be
nonpreemptive?
A. SJF
B. RR
C. FCFS
D. Priority Algorithms
, 4|Page
C. FCFS
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
D. It is the most general CPU scheduling algorithm
The ___ occurs in FCFS scheduling when a process with a
long CPU burst occupies the CPU.
A. Dispatch Latency
B. Waiting Time
C. Convoy Effect
D. System Contention Scope
C. Convoy Effect
What effect does the size of the time quantum ahve on the
performance of an RR algorithm.
CMPE320 EXAM 2 FINAL EXAM
TEST REAL EXAM 2025 LATEST
UPDATE 2025 EXAM QUESTIONS
AND CORRECT ANSWERS
Which of the following is true of cooperative scheduling?
A. It requires a timer
,2|Page
B. A process keeps the CPU until it releases the CPU
either by terminating or by switching to a waiting state
C. It incurs a cost associated with access to shared data
D. A process switches from running state to the ready
state when an interrupt occurs.
B. A process keeps the CPU until it releases the CPU
either by terminating or by switching to a waiting state.
___ is the number of processes that are completed per
time unit.
A. CPU Utilization
B. Response Time
C. Turnaround Time
D. Throughput
D. Throughput
___ 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
,3|Page
C. FCFS
D. SJF D. SJF
The ___ scheduling algorithm is designed especially for
time-sharing systems.
A. SJF
B. FCFS
C. RR
D. Multilevel queue
C. RR
Which of the following scheduling algorithms must be
nonpreemptive?
A. SJF
B. RR
C. FCFS
D. Priority Algorithms
, 4|Page
C. FCFS
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
D. It is the most general CPU scheduling algorithm
The ___ occurs in FCFS scheduling when a process with a
long CPU burst occupies the CPU.
A. Dispatch Latency
B. Waiting Time
C. Convoy Effect
D. System Contention Scope
C. Convoy Effect
What effect does the size of the time quantum ahve on the
performance of an RR algorithm.
