A system contains three programs and each requires three tape units for its operation The minimum number of tape units which the system must have such that deadlocks never arise is Gate Computer Science 2014

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Gate-Computer-Science-Engineering-question-paper-2014-->View question


A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________. (Gate Computer Science 2014)

Appeared in Gate Computer Science 2014 question paper

By:Aparna-Dasgupta

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

7


With the above given data, after allocating 2 units of tape to each process, with 1 available unit any of the 3 process can be satisfied in such a way, that No dead lock will be there. So answer is 7 tape units.  

tarun101

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!