Back to the 2022 paper
Similar questions
Database Management SystemConsider the three transactions T1, T2, and T3, and the schedules S1 and S2 given 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);20247mDatabase Management SystemConsider the schedule: R1(X), R2(X), W1(X), W2(X). The schedule is: (i) View serializable only (ii) Conflict serializable (iii) Not serializable (iv) Recoverable20252mDATABASE MANAGEMENT SYSTEMConsider the following ordering schedule — S’ of transactions: `` T1 : R(A); T1 : A := A + 5; T1 : commit; T2 : R(B); T2 : B := B + 5; T3 : R(C); T3 : C := C + 5; T3 : C := C + 5; T4 : R(A); T4 : A := A + 5; T4 : R(D); T4 : D := D + 5; T4 : commit; T2 : commit; T3 : commit; ` Let the initial value of A = B = C = D = 0. The system follows log-based recovery process of *immediate database modification*. The assumption is the concurrency control system uses strict 2PL, and all transactions share a common disk buffer and single log. Explain what happens during the recovery process if a failure occurs at T2 : commit` statement.202114mDATABASE MANAGEMENT SYSTEMShow that the two-phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.202114m
PreviousBriefly explain the ACID properties of the transactions to ensure integrity of the data.NextExplain the reasons for the update, insertion and deletion anomalies.
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.