Neco 2021 Computer Studies Question 40
Practice objective / multiple choice question 40 from the 2021 Neco Computer Studies examination.
Consider the following schedule of two transactions \(T_{1}\) and \(T_{2}\) on data items \(A\) and \(B\):\n\n1. \(T_{1}\): read\(A\)\n2. \(T_{2}\): read\(B\)\n3. \(T_{1}\): write\(A\)\n4. \(T_{2}\): write\(B\)\n5. \(T_{1}\): read\(B\)\n6. \(T_{2}\): read\(A\)\n7. \(T_{1}\): write\(B\)\n8. \(T_{2}\): write\(A\)\n\nIs this schedule conflict‑serializable? If it is, give a serial order of the transactions that is conflict‑equivalent; if not, state that it is not conflict‑serializable.
Answer Options
About This Question
This is Neco 2021 Computer Studies Question 40. It is one of the objective questions from the 2021 Neco Computer Studies examination.
Difficulty level: Hard .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.