The Gateway to Computer Science Excellence
+1 vote
Consider the following schedule.  All the locks are exclusive, and between the
	lock l and  unlock u operations, the corresponding data item is first read and then written. 
	S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A) 
	The schedule will result in a deadlock.

1.  True

2.  False

in Databases by (255 points) | 32 views

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,833 questions
57,713 answers
107,715 users