627 views
3 votes
3 votes
Choose the correct option about the following schedule.
S:R2(A);W3(A);(commitT3);W1(A);(commitT1);W2(B);R2(C);(commitT2);R4(A);R4(B);(commitT4)
 

1.  S is both recoverable and conflict serializable

2.  S is neither recoverable nor conflict serializable

3.  S is recoverable but not conflict serializable

4.  S is not recoverable but conflict serializable

1 Answer

0 votes
0 votes

As there is no cycle present in the graph, so it is conflict serializable schedule.

This schedule does not involve the read of database item from any uncommitted transaction, so it is a recoverable schedule as well.

So, answer is option(1)

Related questions

1 votes
1 votes
0 answers
3
gulsanchouhan asked Sep 28, 2017
330 views
Which of the following can be described as a programming model used to develop applications processing massive amounts of data in a distributed and/or parallel manner?1. ...
1 votes
1 votes
0 answers
4
gulsanchouhan asked Sep 28, 2017
379 views
Consider the following databaseCol 1Col 2Col 3123456789If Col1 and Col2 form a column family and Col3 is another column family, how is the data stored?A. 1 2 3 4 5 6 7 8 ...