Question 26
In Banker's Algorithm, if the Allocation matrix and Max matrix are given, how is the Need matrix calculated?
In Banker's Algorithm, Need[i][j] = Max[i][j] - Allocation[i][j].
In Banker's Algorithm, if the Allocation matrix and Max matrix are given, how is the Need matrix calculated?
In Banker's Algorithm, Need[i][j] = Max[i][j] - Allocation[i][j].
Which deadlock handling technique involves rolling back a process to a safe checkpoint?
Deadlock recovery breaks deadlocks by aborting deadlocked processes or rolling them back to previously saved checkpoints.
A situation where a thread continually changes its state in response to changes in another thread without doing useful work is -
Livelock occurs when processes actively alter their states regarding one another, but neither makes forward progress.
The critical section problem requires satisfying three criteria: Mutual Exclusion, Progress, and -
Any valid critical section solution must satisfy Mutual Exclusion, Progress, and Bounded Waiting.
The main memory architecture component that translates logical addresses to physical addresses is -
The Memory Management Unit (MMU) is a hardware device that maps virtual (logical) addresses to physical memory addresses.