Which of the following is a way to recover from the deadlock which has already occurred?
Show Hint
- Process termination
- Non preemption of resources
- Banker's algorithm
- Circular wait
The Correct Option is A
Solution and Explanation
Step 1: Deadlock recovery strategies.
Once a deadlock has occurred, there are several ways to recover from it:
- **Process termination**: Terminating one or more processes involved in the deadlock to break the circular wait condition.
- **Resource preemption**: Forcibly taking resources away from processes to break the hold and wait condition.
Step 2: Analysis of other options.
- (2) **Non preemption of resources**: This condition is part of the deadlock model, not a way to recover from deadlock.
- (3) **Banker's algorithm**: It is a prevention algorithm to avoid deadlock but does not apply for recovering from an already occurred deadlock.
- (4) **Circular wait**: This is one of the conditions that causes deadlock, not a recovery method.
Step 3: Conclusion.
The correct method to recover from a deadlock is **process termination** (1).
Top Questions on Deadlock
Questions Asked in CUET PG exam
- Which of the following is not the application of Divide and Conquer technique?
- CUET (PG) - 2025
- Algorithms
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
- CUET (PG) - 2025
- Pointers and Arrays
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.
- CUET (PG) - 2025
- Scheduling Algorithms