The Gateway to Computer Science Excellence
0 votes
47 views
Given schedule S: r1 (×) w1 (×) r1 (z) w1 (z) r2 (y) w2 (y) r2 (×) w2 (×)

How many Conflicts serializable schedules if we execute as T1 -> T2 [T1 serial T2].
in Databases by (137 points) | 47 views
0

may this question helps you to understand how to solve such type of questions

https://gateoverflow.in/247402/self-doubt-conflict-serializable

0
53?
0
THANK YOU SIR
0
54

Please log in or register to answer this question.

Related questions

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
50,644 questions
56,503 answers
195,553 comments
101,036 users