COMP3311 Final Exam 20T3

The University of New South Wales COMP3311 Database Systems Final Exam 20T3

Database Systems

Question 12 (7 marks)

Consider the following schedule resulting from the concurrent execution of three transactions:

T1:           W(Y)     W(X)

T2:  R(Y)                       W(X)

T3:                                      W(X)

Exercises:

1. Determine whether the schedule is conflict serializable.
   Show your working (but you do not need to draw a precedence graph).

2. Determine whether the schedule is view serializable.
   Show your working.

Instructions:

• Type your answers to this question into a file called q12.txt
• Submit via:   give cs3311 exam_q12 q12.txt  or  Webcms3