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 \( 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
- 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
Questions Asked in GATE CS exam
- GATE CS - 2025
- Adjoint and Inverse of a Matrix
Consider the following code:
int a; int arr[] = {30, 50, 10}; int *ptr = arr[10] + 1; a = *ptr; (*ptr)++; ptr = ptr + 1; printf("%d", a + arr[1] + *ptr);In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative
- GATE CS - 2025
- Geometry
Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.
- GATE CS - 2025
- Programming in C
- If IMAGE and FIELD are coded as FHBNJ and EMFJG respectively then, which one among the given options is the most appropriate code for BEACH?
- GATE CS - 2025
- GATE IN - 2025
- GATE MT - 2025
- GATE NM - 2025
- GATE TF - 2025
- Logical and Analytical Reasoning Skills