Question 47

Computer Awareness Introduction to Operating Systems Easy

We can say that a schedule is conflict serializable?

(A) If a schedule \( T \) can be transformed into a serial schedule \( U \) by a series of swaps of conflicting operations.
(B) If a schedule \( T \) can be transformed into a serial schedule \( U \) by a series of swaps of nonconflicting operations.
(C) If a schedule \( T \) can be transformed into a nonserial schedule \( U \) by a series of swaps of conflicting operations.
(D) If a schedule T can be transformed into a nonserial schedule U by a series of swaps of nonconflicting operations.
✓ Correct Answer: Option B Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

A schedule is conflict serializable if it is conflict-equivalent to some serial schedule.

Two schedules are conflict-equivalent when one can be turned into the other by repeatedly swapping adjacent non-conflicting operations. Operations conflict when they are from different transactions, touch the same data item, and at least one is a write. Conflicting operations can never be swapped, because that would change the result.

Answer: (B)

Practice Similar Introduction to Operating Systems Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2024:

Q6 Consider a system with 1 K pages and 512 frames and each page is of size 2...
Solve →
Q9 How does the number of page frames affect and number of page faults for a...
Solve →
Q55 An operating system cotains 4 user processor each requiring 5 units of...
Solve →
Q56 The current allocation and Maximum requirement of different types of...
Solve →
Q65 How many child processes will be created by following fork() system...
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →