Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged transaction-and-concurrency
1
vote
2
answers
1
GATE CSE 2024 | Set 2 | Question: 9
Once the $\text{DBMS}$ informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its changes are reflected on disk. This property is called durability atomicity consistency isolation
Arjun
asked
in
Databases
Feb 16
by
Arjun
1.9k
views
gatecse2024-set2
databases
transaction-and-concurrency
9
votes
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 41
Consider the following lock requests in the Table below. And note that: $\mathrm{S}(\cdot)$ and $\mathrm{X}(\cdot)$ stand for 'shared lock' and 'exclusive lock', respectively. $T_1, T_2, T_3, T_4$, and $T_5$ represent five transactions. $L M$ ... ), or already dead('-'). Select all that are correct. At t3: a At t6: b At t7: a At t8: -
GO Classes
asked
in
Databases
Feb 5
by
GO Classes
603
views
goclasses2024-mockgate-14
databases
transaction-and-concurrency
two-phase-locking-protocol
multiple-selects
2-marks
3
votes
1
answer
3
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 33
Consider the following two schedules consisting to two transaction $\mathrm{T}_1$ and $\mathrm{T}_2$ : Which of the following is/are true about these schedules? Both $\mathrm{S}_1$ and $\mathrm{S}_2$ are ... and also conflict serializable. $\mathrm{S}_1$ and $\mathrm{S}_2$ are neither conflict equivalent nor conflict serializable.
GO Classes
asked
in
Databases
Jan 28
by
GO Classes
221
views
goclasses2024-mockgate-13
goclasses
databases
transaction-and-concurrency
conflict-serializable
1-mark
8
votes
2
answers
4
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 55
Consider the following partial schedule for several data items for transactions $T_i$ with timestamp $i:$ How many transactions are Aborted by the timestamp scheduler?
GO Classes
asked
in
Databases
Jan 21
by
GO Classes
739
views
goclasses2024-mockgate-12
goclasses
numerical-answers
databases
transaction-and-concurrency
2-marks
2
votes
1
answer
5
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 58
Consider the following notation for operations of transactions: ... above schedules is/are recoverable? Only $\text{S}_2$ Only $\text{S}_3$ Only $\text{S}_1, \text{S}_3$ None
GO Classes
asked
in
Databases
Jan 13
by
GO Classes
329
views
goclasses2024-mockgate-11
goclasses
databases
transaction-and-concurrency
2-marks
4
votes
0
answers
6
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 59
Which of the following statements is/are false? 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$ A ... $2 \mathrm{PL}$ (could have been produced using the $2 \mathrm{PL}$ locking protocol) is conflict-serializable.
GO Classes
asked
in
Databases
Jan 13
by
GO Classes
391
views
goclasses2024-mockgate-11
goclasses
databases
transaction-and-concurrency
conflict-serializable
multiple-selects
2-marks
0
votes
1
answer
7
ISRO 2024
Amongst the ACID properties of a transaction ‘Durability’ property requires that the changes made to the database by a successful transaction persist Except in case of an operating system crash Except in case of a disk crash Except in case of a power failure Always, even if there is a failure of any kind
Ramayya
asked
in
Databases
Jan 7
by
Ramayya
161
views
isro-2024
databases
transaction-and-concurrency
0
votes
1
answer
8
Number of Conflict Serializable Schedules
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$ $T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$ $T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
Harsh Saini_1
asked
in
Databases
Dec 27, 2023
by
Harsh Saini_1
315
views
transaction-and-concurrency
conflict-serializable
databases
0
votes
0
answers
9
madeeasy ots
Sajal Mallick
asked
in
Databases
Nov 20, 2023
by
Sajal Mallick
155
views
made-easy-test-series
transaction-and-concurrency
conflict-serializable
databases
0
votes
0
answers
10
madeeasy workbook
According to me answer is 2.Is it right? Suggestion is needed how to approach this if it is given in more complexity.
Sajal Mallick
asked
in
Databases
Nov 20, 2023
by
Sajal Mallick
160
views
made-easy-booklet
databases
transaction-and-concurrency
conflict-serializable
0
votes
0
answers
11
https://testbook.com/TS-nic-scientist-b/tests/640217b028c19ad10b7fed68?attemptNo=1#/lt-solutions
In a databse system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed write(X) successfully and R-t(X) denotes the ... TS(T₁) < W-t(X) then T₁ is rolled back All of the above. PS: Ans given as B
_Shubham_.Singh_
asked
in
Databases
Jul 10, 2023
by
_Shubham_.Singh_
236
views
transaction-and-concurrency
databases
testbook-test-series
1
vote
1
answer
12
GO Classes 2023 | IIITH Mock Test 1 | Question: 19
Assume by "Serializability", we mean "Conflict Serializability". For the given schedule, which of the following is TRUE? $\text{T}_1$ $\text{T}_2$ $\text{T}_3$ $\text{T}_4$ Read(A) Read(A) Read(A) Write(B) Write(A) Read ... $\text{T}_2, \text{T}_3, \text{T}_1, \text{T}_4$
GO Classes
asked
in
Databases
Mar 26, 2023
by
GO Classes
476
views
goclasses2023-iiith-mock-1
goclasses
databases
transaction-and-concurrency
conflict-serializable
1-mark
1
vote
1
answer
13
GO Classes 2023 | IIITH Mock Test 1 | Question: 48
A simple way to detect a state of deadlock is to construct a wait-for graph. One node is created in the graph for each transaction that is currently executing in the schedule. Whenever a transaction $\text{T}_i$ is waiting to ... for, the directed edge is dropped from the waiting-for graph. Given the graph below, which is/are deadlock free?
GO Classes
asked
in
Databases
Mar 26, 2023
by
GO Classes
370
views
goclasses2023-iiith-mock-1
goclasses
databases
transaction-and-concurrency
multiple-selects
1-mark
Page:
1
2
3
4
5
6
...
14
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged transaction-and-concurrency
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation