A schedule in 2PL is deadlock free if a. Both the local and global wait-for graphs contain

Question:

A schedule in 2PL is deadlock free if…

a. Both the local and global wait-for graphs contain no cycles.

b. The local wait-for graphs contain no cycles.

c. The global wait-for graph contains only a limited number of cycles.

d. The local wait-for graph contains only a limited number of cycles.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: