Q. A schedule S of n transactions is serializable if it is equivalent to some

(A) Serial schedule of the same n transactions.
(B) Non-serial schedule of the same n transactions.
(C) Serial schedule of different n transactions.
(D) Non-serial schedule of different n transactions.

💬 Discuss

✅ Correct Answer: (A) Serial schedule of the same n transactions.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:38 pm in Database Management System (DBMS)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

756

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

91%

Success Rate