edited by
2,258 views
0 votes
0 votes

Match the following $:$ 

$\begin{array}{clcl}  &  \textbf{List – I} &&  \textbf{List – II} \\ \text{a.} & \text{Timeout ordering protocol} & \text{i.} & \text{Wait for graph} \\  \text{b.} & \text{Deadlock prevention} & \text{ii.} & \text{Roll back} \\  \text{c.} & \text{Deadlock detection} & \text{iii.} & \text{Wait-die scheme} \\ \text{d.} & \text{Deadlock recovery} & \text{iv.} & \text{Thomas Write Rule} \\  \end{array}$

$\textbf{Codes :}$

  1. $\text{a-iv; b-iii; c-i; d-ii}$
  2. $\text{a-iii; b-ii; c-iv; d-i}$
  3. $\text{a-ii; b-i; c-iv; d-iii}$
  4. $\text{a-iii; b-i; c-iv; d-iii}$
edited by

3 Answers

4 votes
4 votes

Answer : A

LIST-I                                                 LIST-II
a. Timeout ordering protocol                 iv. Thomas Write Rule
b. Deadlock prevention                        iii. Wait-die scheme
c. Deadlock detection                          i. Wait for graph
d. Deadlock recovery                          ii. Roll back 

Reference :  Timeout ordering protocol Relation with Thomas Write Rule is Here

                   All Explanation Regarding Deadlock is Here 

2 votes
2 votes

Answer is A).

Timeout ordering protocol ===> Thomas Write Rule

Deadlock prevention ===> Wait-die scheme

Deadlock detection ===>  Wait for graph 

Deadlock recovery ===> Roll back

1 votes
1 votes

Option is A

The Thomas Write rule is a rule in timestamp-based concurrency control. 


Wait-die scheme is a non-preemptive technique for deadlock prevention.


A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems.


Some systems facilitate deadlock recovery by implementing checkpoint and rollback.

Answer:

Related questions

1 votes
1 votes
2 answers
1
makhdoom ghaya asked Jul 11, 2016
3,373 views
The output generated by the LINUX command :$ seq 1 2 10will be 1 2 101 2 3 4 5 6 7 8 9 101 3 5 7 91 5 10
0 votes
0 votes
2 answers
2
makhdoom ghaya asked Jul 10, 2016
4,238 views
__________ maintains the list of free disk blocks in the Unix file system.I-nodeBoot blockSuper blockFile allocation table
0 votes
0 votes
3 answers
4
makhdoom ghaya asked Jul 9, 2016
7,527 views
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ page frames in the physical memory for the pages. The page reference string is :$1\; 2\; 3...