Scribd
Upload
2 views

Tutorial_9

The document presents a tutorial on database management systems, focusing on transaction schedules and their properties such as serialization, conflict serializability, and recoverability. It includes multiple-choice questions regarding the correct serialization of transaction schedules, conflict serializability of various schedules, and characteristics of a specific database schedule. The tutorial aims to test understanding of key concepts in transaction management.

Uploaded by

Jagrati Kaushik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Tutorial_9

The document presents a tutorial on database management systems, focusing on transaction schedules and their properties such as serialization, conflict serializability, and recoverability. It includes multiple-choice questions regarding the correct serialization of transaction schedules, conflict serializability of various schedules, and characteristics of a specific database schedule. The tutorial aims to test understanding of key concepts in transaction management.

Uploaded by

Jagrati Kaushik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial 9

CSN-351/AID-523 Database Management Systems

1. Consider the following schedule for transactions T1, T2 and T3.


T1 T2 T3
Read(X)
Read(Y)
Read(Y)
Write(Y)
Write(X)
Write(X)
Read(X)
Write(X)
Which one of the schedules below is the correct serialization of the
above?
a. T1->T3->T2
b. T2->T1->T3
c. T2->T3->T1
d. T3->T1->T2

2. Consider the following four schedules due to three transactions


(indicated by the subscript) using read and write on a data item x,
denoted by R(X) and W(X) respectively. Which one of them is
conflict serializable?
a) R1(X); R2(X); W1(X); R3(X); W2(X);

b) R2(X); R1(X); W2(X); R3(X); W1(X);


c) R3(X); R2(X); R1(X); W2(X); W1(X);
d) R2(X); W2(X); R3(X); R1(X); W1(X);

3. Consider the following schedule S of transactions T1, T2, T3, T4:


Which one of the following statements is CORRECT?
a. S is conflict-serializable but not recoverable
b. S is not conflict-serializable but is recoverable
c. S is both conflict-serializable and recoverable
d. S is neither conflict-serializable nor is it recoverable

4. Consider the following database schedule with two transactions, T1


and T2
S = r2(X); r1(X); r2(Y); w1(X); r1(Y); w2(X); a1; a2

where ri(Z) denotes a read operation by transaction Ti on a variable


Z, wi(Z) denotes a write operation by Ti on a variable Z and ai denotes
an abort by transaction Ti .

Which one of the following statements about the above schedule is


TRUE?

a. S​is non-recoverable.
b. S​is recoverable, but has a cascading abort.
c. S​does not have a cascading abort.
d. ​S is strict.

5. Check whether the given schedule S is view serializable or not.


If yes, then give the serial schedule.

S : R1(A) , W2(A) , R3(A) , W1(A) , W3(A)

You might also like