The questions can come in any order, so make sure you are selecting right option for all questions.
1. Cascadeless schedules are _______.
(b) Recoverable
2.
consider the schedule S given below.
S: R1 (X), W2 (X), W1 (X),
Which of the following statement is correct?
(a) S is neither view nor conflict serializable.
3. A schedule is called __________ if it is conflict equivalent to a serial schedule.
(a) Conflict serializable
4. What are the types of serializability?
(c) View serializability (d) Conflict serializability
5. ___________ are the sequences that indicate the chronological order in which instructions of concurrent transactions are executed.
(a) Schedules
6.
Consider the following transactions with data items P and Q initialized to zero:
T1: read (P) ;
read (Q) ;
if P = 0 then Q : = Q + 1 ;
write (Q) ;
T2: read (Q) ;
read (P) ;
if Q = 0 then P : = P + 1 ;
write (P) ;
Any non-serial interleaving of T1 and T2 for concurrent execution leads to
(b) A schedule that is not conflict serializable
7. If a schedule S1 can be transformed into a schedule S2 by a series of swaps of non-conflicting instructions, then S1 and S2 are said to be ________ schedules.
(c) Conflict equivalent
8.
In a schedule S having 4 transactions executed concurrently. The order of their operation is given below. Find out whether the given schedule is serializable or not?
R1(A), R2(B), W2(A), W3(C), R4(C), R3(A), W3(B), R4(A), W2(B), W4(B), W3(A)
(b) View Serializable
9. Let Ri(z) and Wi(z) denote read and write operations on a data element z by a transaction Tjr respectively. Consider the schedule S with four transactions. S: R4(x) * R2(x) * R3(x) * R1(y) * W1(y) * W2(x) * W3(y) * R4(y) Which one of the following serial schedules is conflict equivalent to S?
(a) T1 -> T3 -> T4 -> T2
10. Every conflict serializable schedule is also ___________ serializable.
(c) View