Q1
What is the formula for Turnaround Time?
Turnaround Time = Completion Time - Arrival Time. It measures total time from arrival to completion.
Q2
Which CPU scheduling algorithm can cause starvation of long processes?
Q3
What does the PCB (Process Control Block) primarily enable?
The PCB stores all process information needed for context switching between processes.
Q4
How many of the 4 Coffman conditions must hold for a deadlock to occur?
All four Coffman conditions (Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait) must hold for deadlock.
Q5
The Banker's Algorithm is used for which deadlock-handling strategy?
All four Coffman conditions (Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait) must hold for deadlock.
Q6
Belady's Anomaly (more frames causing more page faults) occurs with which algorithm?
Belady's Anomaly occurs with FIFO page replacement, where more frames can paradoxically cause more page faults.
Q7
Paging can lead to which type of fragmentation?
Paging causes internal fragmentation because the last page may be only partially filled.
Q8
What primarily causes thrashing?
Thrashing occurs when too many processes compete for too little physical memory, causing excessive page faults.