101. Which of the following schedule are not conflict serializable?
a. r₁(A); w₁(A); r₂ (A); w₂(A); w₁(B)
b. r₁(A); r₁ (B); w₂(A); r₃(A); w₁(B); w₃(A); r₂ (B); w₂ (B)
c. r₁(A); w₁(A); r₂ (A); w₂(A); w₁(B)
d. w₃ (A); r₁ (A); w₁ (B); r₂ (B); w₂(c); r₃ (c)
View Answer Report Discuss Too Difficult!
Answer: (d).w₃ (A); r₁ (A); w₁ (B); r₂ (B); w₂(c); r₃ (c)

102. Determine whether the following transaction is
a. Serializable
b. Conflict serializable
c. View serializable
d. Not – serializable
View Answer Report Discuss Too Difficult!
Answer: (d).Not – serializable

103. In the following figure
a. Deadlock occurs
b. Deadlock never occurs
c. Can’t say
d. None of these
View Answer Report Discuss Too Difficult!
Answer: (a).Deadlock occurs

Page 11 of 11