LIVE Course for free

Rated by 1 million+ students
Get app now
0 votes
297 views
in General by (29.9k points)
closed by
A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?

(a) 2

(b) 3

(c) 4

(d) 1

1 Answer

0 votes
by (29.9k points)
selected by
 
Best answer
Right answer is (a) 2

To explain I would say: None.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...