Register

WHAT SHOULD BE THE ANSWER?

519 views

2 Answers

1 votes
1 votes
in two phase locking deadlock is possible...conservative protocol is  just a way to ensure that deadlock does not happen..Impestamp protocol ensures serializability  and prevents deadlocks but suffers from starvation
User Avatar
0 votes
0 votes
It is tough to get ur question. it is too small but 2PL may cause deadlock .2PL with lock upgrade downgrade wont cause deadlock
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
`JEET asked Dec 19, 2018
425 views
How to solve such question and what should be the answer.
Consider a relation R(ABCDE) and functional dependency F1 = {A → B, C → E, B → D}. If the relation is decomposed into BCNF with lossless decomposition and dependency preserving then total number tables is ___________. I am getting 3 but the answer given is 4.
Consider a relation R(ABCDE) and functional dependency F1 = {A → B, C → E, B → D}.If the relation is decomposed into BCNF with lossless decomposition and dependency...
User Avatar
2 votes
2 votes
1 answer
2
h4kr asked Dec 8, 2022
299 views
What should the answer be?
I think the answer should be (B) would be right, because lets say in R, there is a FD NPA -> CK, it won't qualify as BCNF even if CK is single attribute
I think the answer should be (B) would be right, because lets say in R, there is a FD NPA - CK, it won't qualify as BCNF even if CK is single attribute
User Avatar
0 votes
0 votes
0 answers
3
`JEET asked Dec 17, 2018
349 views
What should be the answer?
int main() { int i, j = 1; for(i = 1; i < 100) { j = j * i; i++; if(i == j) break; } } Which of the following is always correct at the end of the loop. s1: (i = 100) or (i > j) s2: if i = n; then j = (n-1)!; n be some random value s3: (i = 100) or (i == j)
int main() { int i, j = 1; for(i = 1; i < 100) { j = j * i; i++; if(i == j) break; } }Which of the following is always correct at the end of the loop.s1: (i = 100) or (i ...
User Avatar
0 votes
0 votes
0 answers
4
thor asked Jan 10, 2017
519 views
What should be answer 51 or 52?
A B+ tree index is built on the key ‘CS’ attribute of the relation ME16. The attribute ‘CS’ is of length 32 bytes, disk blocks are of size 2048 bytes and index pointers are of size 8 bytes. The number of pointers per node is _______.
A B+ tree index is built on the key ‘CS’ attribute of the relation ME16. The attribute ‘CS’ is of length 32 bytes, disk blocks are of size 2048 bytes and index po...
User Avatar
Link Copied!