Register

UPSC MoD 2022 | SSA | Question: 22

• edited by
74 views
0 0 votes

Which one of the following operations causes database changes to be visible to other transactions?

  1. UPDATE
  2. SUBMIT
  3. RELEASE
  4. COMMIT

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · UPSC MoD 2022 | SSA ...Next → · UPSC MoD 2022 | SSA ...
← Previous in category · UPSC MoD 2022 | SSA ...Next in category → · UPSC MoD 2022 | SSA ...
Position:
Show:

Related questions

0 0 votes
0 0 answers
133
133 views
Shubham Sharma 2 asked Oct 22, 2025
133 views
UPSC MoD 2022 | SSA | Question: 1
The bound $2 n^{2}=\mathrm{O}\left(n^{2}\right)$ isnot asymptotically tightasymptotically tightpositive constant if $\mathrm{n}<0$negative constant if $\mathrm{n}>0$
0 0 votes
0 0 answers
108
108 views
Shubham Sharma 2 asked Oct 22, 2025
108 views
UPSC MoD 2022 | SSA | Question: 2
Which one of the following sorting algorithms of quadratic time complexity is preferred in practice for small problem size?Insertion sortSelection sortBubble sortRecursiv...
0 0 votes
0 0 answers
108
108 views
Shubham Sharma 2 asked Oct 22, 2025
108 views
UPSC MoD 2022 | SSA | Question: 3
In transpose symmetry, $\mathrm{f}(\mathrm{n})=\mathrm{O}(\mathrm{g}(\mathrm{n}))$ if and only if$\mathrm{g}(\mathrm{n})=\mathrm{o}(\mathrm{f}(\mathrm{n}))$$\mathrm{g}(\m...
0 0 votes
0 0 answers
76
76 views
Shubham Sharma 2 asked Oct 22, 2025
76 views
UPSC MoD 2022 | SSA | Question: 4
Consider the recurrence equation that has upper bounds $\mathrm{T}(\mathrm{n})$ as given below :$\begin{array}{l}T(1)=1 \\T(n)=2 T(n-1)+n, \text { for } n \geq 2 .\end{ar...