Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery. Which of the following statements is/are correct?
Show Hint
- The same undo and redo list will be used while recovering again.
- The system cannot recover any further.
- All the transactions that are already undone and redone will not be recovered again.
- The database will become inconsistent.
The Correct Option is A
Solution and Explanation
Step 1: Effect of crash during recovery.
When a database crashes during recovery and no checkpointing is used, the recovery process must restart from the beginning using the log.
Step 2: Undo and redo lists.
Since there is no checkpoint to record progress, the system cannot determine which undo or redo actions were completed before the second crash. Hence, the same undo and redo lists are reconstructed and applied again.
Step 3: Evaluation of options.
Statement (A) is correct because recovery restarts with the same undo and redo lists.
Statement (B) is incorrect since recovery is still possible.
Statement (C) is incorrect because operations may be repeated without checkpointing.
Statement (D) is incorrect because recovery mechanisms ensure consistency.
Top Questions on Transactions and concurrency control
- Let $R(z)$ and $W(z)$ denote read and write operations on a data element $z$ by a transaction $T_i$, respectively. Consider the schedule $S$ with four transactions.
\[ S: R_1(x) R_2(x) R_3(y) W_1(y) W_2(x) W_3(y) R_4(y) \] Which one of the following serial schedules is conflict equivalent to $S$?- GATE CS - 2022
- Database Management Systems
- Transactions and concurrency control
- Let \(S\) be the following schedule of operations of three transactions \(T_1, T_2\) and \(T_3\) in a relational database system:
\[ R_2(Y),\; R_1(X),\; R_3(Z),\; R_1(Y),\; W_1(X),\; R_2(Z),\; W_2(Y),\; R_3(X),\; W_3(Z) \] Consider the statements \(P\) and \(Q\) below:
\[ P:\ S \text{ is conflict-serializable.} \] \[ Q:\ \text{If } T_3 \text{ commits before } T_1 \text{ finishes, then } S \text{ is recoverable.} \] Which one of the following choices is correct?- GATE CS - 2021
- Database Management Systems
- Transactions and concurrency control
Let \( r_i(z) \) and \( w_i(z) \) denote read and write operations respectively on a data item \( z \) by a transaction \( T_i \). Consider the following two schedules.
\[ \begin{aligned} S_1 &: r_1(x)\; r_1(y)\; r_2(x)\; r_2(y)\; w_2(y)\; w_1(x) \\ S_2 &: r_1(x)\; r_2(x)\; r_2(y)\; w_2(y)\; r_1(y)\; w_1(x) \end{aligned} \] Which one of the following options is correct?- GATE CS - 2021
- Database Management Systems
- Transactions and concurrency control
Questions Asked in GATE CS exam
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
- GATE CS - 2025
- Flip-Flop
Consider the following C code segment:
int x = 126, y = 105; do { if (x > y) x = x - y; else y = y - x; } while (x != y); printf("%d", x);The output of the given C code segment is ____________. (Answer in integer)
- GATE CS - 2025
- Programming in C
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
Multiplicand (\( M \)) Multiplier (\( Q \)) 1100 1101 1110 1101 1010 0100 1010 1010 The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
- GATE CS - 2025
- Complementation
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
- GATE CS - 2025
- Programming and Data Structures
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).- GATE CS - 2025
- Programming in C