302 views
1 votes
1 votes
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

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
4
gulsanchouhan asked Sep 28, 2017
342 views
Which of the following can be described as a programming model used to develop applications processing massive amounts of data in a distributed and/or parallel manner?1. ...