Free Test Serializability and Sc... – Databas...

Q1: What is a schedule in transaction management?

A. A sequence of operations from multiple transactions B. A single transaction C. Database backup process D. Index creation process

Q2: What does serializability ensure?

A. Concurrent execution is equivalent to some serial execution B. Transactions run in parallel C. Transactions are rolled back D. Data is encrypted

Q3: Which schedule type preserves transaction isolation?

A. Serializable schedule B. Concurrent schedule C. Non-serial schedule D. Uncontrolled schedule

Q4: What is a conflict in schedules?

A. When two operations access same data and at least one is a write B. Two transactions committing C. Database backup D. Index creation

Q5: What is conflict serializability?

A. A schedule can be transformed into a serial schedule by swapping non-conflicting operations B. All schedules are serializable C. No conflicts in schedule D. Transactions execute one after another

Q6: What is view serializability?

A. Schedules that produce the same final state as a serial schedule B. All schedules are view serializable C. Schedules with no conflicts D. Serial execution only

Q7: Which serializability type is stricter?

A. Conflict serializability B. View serializability C. All schedules D. None

Q8: What is a non-serial schedule?

A. A schedule where transactions are interleaved B. Transactions executed one by one C. Backup process D. Index creation

Q9: What is a recoverable schedule?

A. A schedule where transactions commit only after transactions they depend on commit B. A schedule that is serial C. A schedule with no conflicts D. Schedule without rollback

Q10: What is a cascadeless schedule?

A. A recoverable schedule with no cascading aborts B. A serial schedule C. A schedule with conflicts D. Schedule without commit

Q11: What problem does a schedule with lost update cause?

A. One update overwrites another without being seen B. Data is deleted C. Transaction rollback D. Commit failure

Q12: What is a dirty read in scheduling?

A. Reading uncommitted data from another transaction B. Reading committed data C. Writing data twice D. Lost update

Q13: What does strict two-phase locking guarantee?

A. Conflict serializability and recoverability B. Only conflict serializability C. Only recoverability D. No deadlocks

Q14: Which of the following can cause deadlocks?

A. Two transactions waiting for each other’s locks B. Single transaction C. Commit operation D. Database backup

Q15: What is a schedule’s precedence graph used for?

A. To test conflict serializability B. To backup data C. To create indexes D. To rollback transactions

Q16: If a schedule’s precedence graph has no cycles, what does it imply?

A. Schedule is conflict serializable B. Schedule is non-recoverable C. Schedule is non-serializable D. Schedule causes deadlocks

Q17: Which schedule type can lead to cascading rollbacks?

A. Recoverable but not cascadeless schedule B. Serial schedule C. Non-recoverable schedule D. Conflict serializable schedule

Q18: What is the main goal of concurrency control?

A. Ensure correctness and consistency of concurrent transactions B. Improve backup speed C. Optimize queries D. Delete old data

Q19: Which of the following is NOT a property of schedules?

A. Atomicity B. Recoverability C. Cascadelessness D. Serializability

Quiz for Serializability and Schedules