Assume we have locks X and Y with operations lock and unlock. Show how we can get a deadlock in the code of the previous question. _________
Fill in the blank(s) with the appropriate word(s).
One assignment: lock(x); lock(y); A := 2*A; A:=A+1; unlock(x);
unlock (y);
Second assignment: lock(y); lock(x); A := 2*A; A:=A-1; C:= 2*A; unlock
(y);unlock(x);
Computer Science & Information Technology
You might also like to view...
External SSDs usually connect to a computer via USB
Indicate whether the statement is true or false
Computer Science & Information Technology
Changes to page number formatting apply only to the ____ in which the change is made originally.
A. section B. page C. area D. footer
Computer Science & Information Technology