Test: Transactions & Concurrency Control- 2 - Computer Science Engineering (CSE) MCQ

Schedule should be serializable

Schedule should be recoverable

Both (a) and (b)

None of these

(i) only

(i) and (ii)

(ii) only

None of these

Will be always serializable

Will never serializable

May be serializable

Can’t say

Much larger than n!

Much lower than n!

Much larger than ( n - 1)!

Much low erthan ( n - 1)!

Dirty Read

Uncommitted Dependency

Inconsistent Analysis

Lost Update

We must redo log record 6 set B to 10500.

We must undo log record 6 to set B to 10000 and then redo log records 2 and 3.

We need not redo log records 2 and 3 because transaction T₁ has committed.

We can apply redo and undo operations in arbitrary order because they are idempotent.

Both S₁ and S₂ are conflict serializable.

S₁ is conflict serializable and S₂ is not conflict serializable.

S₁ is not conflict serialization and S₂ is conflict serializable.

Both S₁ and S₂ are not conflict serializable.

That the transaction schedule is unserializable.

Nothing as there is not enough information in the graph.

That the transaction schedule-is serializable.

That the transaction schedule could be both serializable and unserializable.

In a wait-die system, if P needs a resource held by Q, then Pwaits.

In a wait-die system, if Q needs a resource held by P, then Q waits.

In wound-wait system, if P needs a resource held by Q, then Q yields and waits.

in a wound-wait system, if Q needs a resource held by P, then Q dies.

This schedule is serializable and can occur in a scheme using 2PL protocol.

This schedule is serializable but cannot occur in a scheme using 2PL protocol.

This schedule is not serializable but can occur in a scheme using 2PL protocol.

This schedule is not serializable and cannot occur in a scheme using 2PL protocol.

The schedule is seriaiizabie as T2; T3; T1;

The schedule is serializable as T2; T1; T3;

The schedule is serializable as T3; T2; T1;

The schedule is not serializable

Both S₁ and S₂ are conflict seriaIizabIe

S₁ is conflict seriaiizabie and S₂ is not conflict serializable

S₁ is not conflict serializable and S₂ is conflict seriaIizabIe

Both S₁ and S₂are not conflict serializable

It is on a set of fields that form a candidate key.

It is on a set of fields that include the primary key.

The data record of the file are organized in the same order as the date entries of the index.

The data records of the file are organized not in the same order as the data entries of the index.

S₁ and S₂

S₄ only

S₃ only

S₂ and S₃

r₁(x); r₂(x); w₁(x); r₃(x); w₂(x)

r₂(x); r₁(x); w₂(x); r₃(x); w₁(x)

r₃(x); r₂(x); w₁(x); r₂(x); w₁(x)

r₂(x); r₃(x); w₂(x); r₁(x); w₁(x)