GATE - 2004 | OS | Consider the following schedule S of transactions T1 and T2:

GATE - 2004 | OS | Consider the following schedule S of transactions T1 and T2:
Posted on 22-02-2022

GATE - 2004 [Operating System]

Question:

Consider the following schedule S of transactions T1 and T2:

Consider the following schedule S of transactions T1 and T2: T1	T2 Read(A)A = A - 10	Read (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

    

Solution:

Option (E) is Correct.

The given statement is not serializable as cycle exist in precedence graph. Therefore, options A, B, C, D are not correct.

Thank You

Download App for Free PDF Download

GovtVacancy.Net Android App: Download

government vacancy govt job sarkari naukri android application google play store https://play.google.com/store/apps/details?id=xyz.appmaker.juptmh