We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

Q.No.1

 

Suppose a Computer lab consists of two laser printers, three tape drives, and four ROM writers. Let us assume that Process 1 is currently using a printer and two ROM writers, Process 2 is using a tape drive, and Process 3 is using two ROM writers, a tape drive, and a printer. Now suppose that Process 1 requires a tape drive, Process 2 requires a printer, and Process 3 requires one more ROM writer.

 

You are required to develop the corresponding Resource Allocation Graph for this scenario. Moreover, you are required to tell either the system in a Deadlocked state or not?

 

Q.No.2

 

Suppose a system with twelve tape drives and three processes named as P1, P2 and P3. The current system state is as shown in the following table.

 

Process

Max Need

Allocated

Available

P1

11

4

4

P2

4

2

 

P3

7

2

 

 

The available tape drives are four. You are required to calculate Need and Available matrices and find Safe sequence (if possible) with the help of information given in the above table.

 

Note: File name other than your Student ID will not get marks. File other than Microsoft Word will not be accepted.


+ Click Here To Join also Our facebook study Group.


+ Prohibited Content On Site + Report a violation + Report an Issue


..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 5763

.

+ http://bit.ly/vucodes (Vu Study Groups By Subject Codes Wise)

Attachments:

Replies to This Discussion

mjy  2nd question ki kuch samj nhi a rahi  hai kindly koe help kr do 

bhot simple hai ooper maine video post ki hai helping material ki woh dekho. 

kiya Extended day mila ga assignment ka ?

ok thanks

iss video main A B C ki values kahan sy li gai hain please explain kr dai thanks

solution plsss....??

RSS

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service