Operating-Systems
October 5, 2023Software-Engineering
October 5, 2023Operating-Systems
Question 14
|
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 + Temp Write(B)
Which of the following is TRUE about the schedule S?
S is serializable only as T1, T2
|
|
S is serializable only as T2, T1
|
|
S is serializable both as T1, T2 and T2, T1
|
|
S is serializable either as T1 or as T2
|
|
None of these
|
Question 14 Explanation:
The given statement is not serializable as cycle exist in precedence graph. Therefore, options A, B, C, D are not correct.
Correct Answer: E
Question 14 Explanation:
The given statement is not serializable as cycle exist in precedence graph. Therefore, options A, B, C, D are not correct.
Subscribe
Login
0 Comments