Question 21
A situation where two or more processes are blocked indefinitely waiting for each other is called -
Deadlock occurs when processes are permanently blocked waiting for resources held by one another.
A situation where two or more processes are blocked indefinitely waiting for each other is called -
Deadlock occurs when processes are permanently blocked waiting for resources held by one another.
Peterson's solution provides a software-based solution for critical section problems for how many processes?
Peterson's Algorithm is a classic software solution for mutual exclusion between exactly 2 processes using turn and flag variables.
Semaphores were invented by -
Edsger W. Dijkstra introduced integer semaphores and P (wait) / V (signal) operations for process synchronization.
A counting semaphore initialized to 10 has 6 P (wait) operations and 2 V (signal) operations performed on it. What is the final value?
Initial = 10; 6 P operations decrease it by 6 (10 - 6 = 4); 2 V operations increase it by 2 (4 + 2 = 6). Final value = 6.
In a Resource Allocation Graph (RAG), if every resource type has only one instance, a cycle in the graph indicates -
In single-instance resource systems, a cycle in the Resource Allocation Graph is a necessary and sufficient condition for deadlock.