Skip to content
Related Articles

Related Articles

GATE | GATE-IT-2004 | Question 77

Improve Article
Save Article
  • Last Updated : 20 Mar, 2018
Improve Article
Save Article

Consider the following schedule S of transactions T1 and T2:

T1T2
Read(A)A = A – 10Read (A)Temp = 0.2*A

Write(A)

Read(B)

Write(A)Read(B)
B = B + 10
Write(B)
B = B + TempWrite(B)

(A) S is serializable only as T1, T2
(B) S is serializable only as T2, T1
(C) S is serializable both as T1, T2 and T2, T1
(D) S is serializable either as T1 or as T2
(E) None of these


Answer: (E)

Explanation: This given schedule is not serializable as cycles exist in precedence graph .Therefore, options A, B, C, D are practically not possible.

The answer should be schedule is NOTĀ serializable both as T2,T1 and T1,T2

Ā 

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!