Question 1
What is a serial schedule in DBMS?
Transactions are interleaved
Transactions are executed in parallel
Transactions are executed one after another
Transactions skip certain operations
Question 2
Which of the following types of schedule always preserves consistency?
Non-serial schedule
Serial schedule
Preemptive schedule
Parallel schedule
Question 3
What makes a schedule conflict-serializable?
It uses timestamps
It has no conflicting operations
It is equivalent to a serial schedule under conflict rules
It allows concurrent writes
Question 4
In a schedule, which of the following operations conflict?
Read–Read
Read–Write on same item
Write–Write on different items
Read–Write on different items
Question 5
Which schedule allows concurrent execution but still ensures correctness like a serial schedule?
Non-serializable schedule
Serial schedule
Serializable schedule
Cascading schedule
Question 6
What is the necessary condition for a schedule to be conflict serializable?
No transaction commits
No cycles in the precedence graph
All transactions are aborted
At least one transaction is read-only
Question 7
Which type of schedule is guaranteed to be conflict-serializable?
Preemptive
Serial
View equivalent
Cascading
Question 8
What does conflict equivalence depend on?
Transaction execution time
Number of data items accessed
Order of conflicting operations
Final state of database
Question 9
Which schedule type may lead to inconsistency if not properly controlled?
Serial
Non-serial and non-serializable
Conflict-serializable
View-serializable
Question 10
What does a serializable schedule ensure in DBMS?
No concurrent execution
No transaction aborts
Consistency as if executed serially
Transactions are always committed
There are 10 questions to complete.