Important DBMS Transaction Scheduling MCQ Questions with Answers (Set 1) | IBPS IT Officer, GATE

This set of Multiple Choice Questions (MCQs) covers advanced concepts of Database Management Systems, including serial schedules, conflict serializability, recoverability, and concurrency control. Useful for IBPS IT Officer and GATE and other competetive exams.

Topic: Database Management System (Transaction Scheduling) | Set: 1

Difficulty: Medium | Total Questions: 15

DBMS Transaction Scheduling MCQ

Q1. A schedule where the operations of each transaction are executed consecutively without any interleaved operations is called:

A. Concurrent Schedule
B. Serial Schedule
C. Non-serial Schedule
D. Conflict Schedule

Q2. Two operations are said to be in “conflict” if they belong to different transactions, access the same data item, and:

A. Both are Read operations
B. At least one is a Write operation
C. Both are Commit operations
D. They access different data items

Q3. A schedule S is “Recoverable” if for every pair of transactions Ti and Tj such that Tj reads a data item previously written by Ti:

A. Tj commits before Ti
B. Ti commits before Tj
C. Ti and Tj commit at the same time
D. Neither transaction ever commits

Q4. Which property of a transaction ensures that all its operations are reflected in the database or none are?

A. Isolation
B. Consistency
C. Durability
D. Atomicity

Q5. A schedule that is equivalent to some serial execution of transactions is called:

A. Recoverable Schedule
B. Serializable Schedule
C. Cascadeless Schedule
D. Strict Schedule

Q6. What is a “Blind Write”?

A. Writing a value without reading it first
B. Reading a value without writing it
C. Writing to a disk that is turned off
D. Writing a value twice in the same transaction

Q7. In a “Cascadeless” schedule, if Tj reads a data item written by Ti:

A. Ti must commit before Tj reads the item
B. Ti must commit after Tj reads the item
C. Ti never needs to commit
D. Tj must abort immediately

Q8. If a schedule is “Conflict Serializable,” it is also guaranteed to be:

A. View Serializable
B. Irrecoverable
C. Non-serial
D. Always Strict

Q9. The problem where a transaction reads a value that was updated by an uncommitted transaction is called:

A. Lost Update
B. Dirty Read
C. Unrepeatable Read
D. Phantom Read

Q10. Which of the following is the most restrictive (strictest) type of schedule?

A. Recoverable
B. Cascadeless
C. Strict
D. Serializable

Q11. A precedence graph is used to check for:

A. Recoverability
B. Conflict Serializability
C. Deadlocks
D. Atomicity

Q12. In a precedence graph, an edge from Ti to Tj is drawn if:

A. Ti and Tj are serial
B. Ti executes before Tj in a conflict
C. They read the same data
D. Ti commits before Tj

Q13. Which of these is a serial schedule for T1 and T2?

A. R1(A), W1(A), R2(A), W2(A)
B. R1(A), R2(A), W1(A), W2(A)
C. W1(A), W2(B), R1(B), R2(A)
D. R1(A), W2(A), W1(A), R2(A)

Q14. Every Cascadeless schedule is also a:

A. Strict Schedule
B. Recoverable Schedule
C. Serial Schedule
D. View Serializable Schedule

Q15. The Thomas Write Rule is related to:

A. Conflict Serializability
B. View Serializability
C. Recoverability
D. Strictness

Conclusion

These DBMS Transaction Scheduling MCQs help strengthen your understanding of important concepts like serial schedules, conflict serializability, recoverability, and concurrency control. Mastering these topics is essential for exams like GATE, IBPS IT Officer, and technical interviews.

Regular practice of such MCQs improves problem-solving speed and conceptual clarity in database systems, especially in areas related to transaction management and isolation levels.

For detailed theory and understanding of concepts, refer to Different types of Schedules in DBMS.

What’s Next ?

• DBMS Concurrency Control MCQs
• DBMS Normalization MCQs
• DBMS Indexing MCQs