Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 3 - Operating Systems - Section 3.4 - Handling Competition Among Processes - Questions & Exercises - Page 159: 3

Answer

a. This guarantees that the nonsharable resource is not required and allocated on a partial basis; that is, a car is given the whole bridge or nothing at all. b. This means that the nonsharable resource can be forcibly retrieved. c. This makes the nonsharable resource shareable, which removes the competition.

Work Step by Step

a. This guarantees that the nonsharable resource is not required and allocated on a partial basis; that is, a car is given the whole bridge or nothing at all. b. This means that the nonsharable resource can be forcibly retrieved. c. This makes the nonsharable resource shareable, which removes the competition.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.