GO Classes Test Series 2025 | NIELIT Mock Test 1 | Question: 108

How many of the following are FALSE? 

1. In a cascade-less schedule if a transaction $T_j$ read a data item written by transaction $T_i$ then the commit of $T_i$ has to be before this read operation of $T_j$
2. A recoverable schedule is also cascade-less
3. Not all conflict-serializable schedules are also 2PL
4. A schedule that is $2 \mathrm{PL}$ (could have been produced using the $2 \mathrm{PL}$ locking protocol) is conflict-serializable.

1. 1
2. 2
3. 3
4. 4