Scribd
Upload
0 views1 page

DBMS Assignment4

Good

Uploaded by

kashyapkartik152
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 views1 page

DBMS Assignment4

Good

Uploaded by

kashyapkartik152
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Approved by AICTE, Govt. of India & Affiliated to Dr.

APJ Abdul

GL BAJAJ Kalam Technical University, Lucknow, U.P., India


Institute of Technology & Management Department of Computer Sc. & Engineering (AI)
Greater Noida

ASSIGNMENT – 4

SUBJECT: Database management system SUBJECT CODE: BCS501


ISSUED DATE: 05/12/24 SUBMISSION DATE: 10/12/24

1. Explain the method of testing the serializability. Consider the schedule


S1 and S2 given below
S1: R1(A),R2(B),W1(A),W2(B)
S2: R2(B),R1(A),W2(B), W1(A)
Check whether the given schedules are conflict equivalent or not?
2. Explain Time Stamp Based Concurrency Control technique.
3. Describe serializable schedule. Discuss conflict serializability with suitable 4. Discuss
the procedure of deadlock detection and recovery in transaction?
5. Consider the three transactions T1, T2, and T3, and the schedules S1 and S2given below.
State whether each schedule is serializable or not. If a schedule is serializable, write
down the equivalent serial schedule(s).
T1: r1 (X); r1 (Z); w1 (X);
T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);
T3: r3 (X); r3 (Y); w3 (Y);
S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);
S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);

You might also like