Operations Management > QUESTIONS & ANSWERS > Virginia TechCMP 641W3_Assignment #1-QUESTIONS WITH VERIFIED ANSWERS (All)

Virginia TechCMP 641W3_Assignment #1-QUESTIONS WITH VERIFIED ANSWERS

Document Content and Description Below

TITLE PAGE Course: CMP 641 Operating System Assignment: W3_Assignment #1 Question Number 6.5: Given the following state for the Banker’s Algorithm. 6 processes P0 through P5 4 resource types ... : A (15 instances); B (6 instances) C (9 instances); D (10 instances) Snapshot at time T0: a. V erify that the Available array has been calculated correctly. Solution: Considering the following given data A=6, B=3, C=5, D=4. To calculate the available array is Available for process (n) = total resource required to be process is (n) – current resource assigned to be process (n). For A available resource A= 15-(2+0+4+1+1+1)  15-9 = 6 For B available resource B= 6 - (0+1+1+0+1+0)  6 - 3 = 3 For C available resource C = 9 - (2+1+0+0+0+1)  9 - 4 = 5 [Show More]

Last updated: 3 years ago

Preview 1 out of 4 pages

Buy Now

Instant download

We Accept: