Homework 4

Assigned: Feb. 17
Due: Feb. 26

Problem 1

(Tanenbaum Problem 3.18) A computer has six tape drives with n processes competing for them. Each process may need two drives. For which values of n deadlock free?

Problem 2

Suppose you have the following deadlocked situation. There are five processes, A,B,C,D,E and five resources U,V,W,X,Y.
A holds U and is requesting X.
B holds V and is requesting U and W.
C holds Y and is requesting V.
D holds W and is requesting U and Y.
E is requesting V.