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
madeeasy ots
Sajal Mallick
asked
in
Databases
Nov 20, 2023
168
views
0
votes
0
votes
made-easy-test-series
transaction-and-concurrency
conflict-serializable
databases
Sajal Mallick
asked
in
Databases
Nov 20, 2023
by
Sajal Mallick
168
views
answer
comment
Follow
share this
share
1 comment
by
Chandrabhan Vishwa 1
commented
Nov 26, 2023
reply
Follow
share this
Ans should be 12
make the precedence graph equivalent to given schedule and find total number of topological sort possible from the given precedence graph
2
2
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Sajal Mallick
asked
in
Databases
Nov 20, 2023
171
views
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
171
views
made-easy-booklet
databases
transaction-and-concurrency
conflict-serializable
3
votes
3
votes
1
answer
2
GO Classes
asked
in
Databases
Jan 28
240
views
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
240
views
goclasses2024-mockgate-13
goclasses
databases
transaction-and-concurrency
conflict-serializable
1-mark
4
votes
4
votes
0
answers
3
GO Classes
asked
in
Databases
Jan 13
419
views
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
419
views
goclasses2024-mockgate-11
goclasses
databases
transaction-and-concurrency
conflict-serializable
multiple-selects
2-marks
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
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
