PRACTICE • LEARN • GROW
Module 3 Final Quiz: CPU Scheduling MCQs
Solve topic-wise placement questions and improve your skills.
Module 3 Final Quiz: CPU Scheduling Progress
0 of 10 completed
0%
Topic Track
You are viewing MCQs in preview mode. Log in to select options, submit answers, and track your progress.
Log In to Answer
1
What is the definition of Turnaround Time in CPU scheduling?
A.
The time spent waiting in the ready queue
B.
The interval from the time of process submission (arrival) to the time of its completion
C.
The time taken from submission until the first response is produced
D.
The total CPU burst duration
Explanation & Key
Correct Answer:
2
What is the Convoy Effect in First-Come, First-Served (FCFS) scheduling?
A.
Multiple I/O bound processes blocking a CPU bound process
B.
Short processes waiting behind a long, CPU-intensive process, resulting in poor CPU and device utilization and high average waiting time
C.
Processes arriving at identical arrival times
D.
Deadlock among multiple threads
Explanation & Key
Correct Answer:
3
Which CPU scheduling algorithm is mathematically proven to achieve the minimal average waiting time for a given set of processes?
A.
First-Come, First-Served (FCFS)
B.
Shortest Job First (SJF / Shortest Remaining Time First)
C.
Round Robin (RR)
D.
Multilevel Queue Scheduling without feedback
Explanation & Key
Correct Answer:
4
Why is pure Shortest Job First (SJF) rarely implemented in general-purpose interactive operating systems?
A.
It consumes too much memory
B.
It is impossible for the OS to know the exact length of the next CPU burst in advance without predicting it via exponential smoothing
C.
It causes hardware damage to CPU registers
D.
It cannot execute multi-threaded programs
Explanation & Key
Correct Answer:
5
In Round Robin (RR) scheduling, what happens if the time quantum (time slice) is set excessively large?
A.
RR degenerates into FCFS (First-Come, First-Served)
B.
Context switching overhead explodes to 90% of CPU time
C.
Short processes are prioritized
D.
Starvation of long processes occurs
Explanation & Key
Correct Answer:
6
In Round Robin (RR) scheduling, what is the consequence of choosing a very tiny time quantum (e.g. 1 microsecond)?
A.
The system behaves as FCFS
B.
Context switching overhead dominates CPU cycles, drastically degrading overall system throughput
C.
Processes experience starvation
D.
Memory fragmentation occurs
Explanation & Key
Correct Answer:
7
What is Starvation in priority-based CPU scheduling, and what standard technique solves it?
A.
A process running out of RAM; solved via paging
B.
Low-priority processes waiting indefinitely as higher-priority processes arrive continuously; solved via Aging (gradually increasing priority over time)
C.
A deadlock between two processes; solved via semaphores
D.
High context-switch frequency; solved via larger time slices
Explanation & Key
Correct Answer:
8
What is Priority Inversion?
A.
When a high-priority process is preempted by an interrupt handler
B.
When a high-priority process is blocked waiting for a shared resource held by a low-priority process, while medium-priority processes preempt the low-priority process, delaying both
C.
When the scheduler assigns priority 0 to kernel tasks
D.
When process priority is multiplied by -1
Explanation & Key
Correct Answer:
9
What distinguishes a Multilevel Feedback Queue (MLFQ) from a static Multilevel Queue?
A.
MLFQ uses only one queue with priority bits
B.
MLFQ allows processes to move between different priority queues based on their observed CPU burst behavior (e.g., demoting CPU-bound jobs, promoting interactive I/O jobs)
C.
MLFQ does not allow preemptive scheduling
D.
MLFQ is designed solely for batch processing systems
Explanation & Key
Correct Answer:
10
Consider 3 processes arriving at time 0 with bursts P1=24, P2=3, P3=3 under FCFS order P1, P2, P3. What is the average waiting time?
A.
17 ms
B.
30 ms
C.
27 ms
D.
10 ms
Explanation & Key
Correct Answer:
Question Palette
Answered
Current
Not Attempted
Wrong
