Serializability Quiz

Last Updated :
Discuss
Comments

Question 1

Which of the following is a condition for view serializability?

  • Same lock order in transactions

  • Same transaction length

  • Same final writes and read-from relationships

  • Same timestamp order

Discuss it

Question 2

Conflict serializability is a subset of which of the following?

  • View serializability

  • Cascadeless schedules

  • Conservative protocols

  • Optimistic concurrency

Discuss it

Question 3

What is a precedence graph used for?

  • Scheduling disk access

  • Testing deadlock

  • Testing conflict serializability

  • Measuring transaction execution time

Discuss it

Question 4

In a precedence graph, what does a cycle indicate?

  • A schedule is serializable

  • The schedule is view equivalent

  • A deadlock has occurred

  • The schedule is not conflict-serializable

Discuss it

Question 5

Which of the following is not required for view equivalence between two schedules?

  • Same set of transactions

  • Same read-from relationship

  • Same final write

  • Same lock types

Discuss it

Question 6

Which conflict causes an edge in the precedence graph from Ti to Tj?

  • Ti reads after Tj writes

  • Ti writes after Tj writes to same item

  • Ti writes after Tj reads

  • All of the above

Discuss it

Question 7

Why view serializability allows more schedules than conflict serializability ?

  • It considers lock types

  • It checks transaction priorities

  • It ignores final writes

  • It is based on read-from and final-write relationships

Discuss it

Question 8

Which of the following always guarantees a conflict-serializable schedule?

  • Precedence graph without cycles

  • View-equivalent schedules

  • Timestamp ordering protocol

  • Deadlock detection

Discuss it

Question 9

Which is easier to test programmatically:

  • View serializability

  • Conflict serializability

  • Both equally

  • Neither

Discuss it

Question 10

In view serializability, what does it mean for two schedules to be “view equivalent”?

  • They have identical lock sequences

  • They have the same number of transactions

  • They produce the same results for reads and final writes

  • They use different operations but execute in parallel

Discuss it

There are 10 questions to complete.

Take a part in the ongoing discussion