1

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?

Correct Answer: 2

Make the most of this question

This page focuses on one Operating System (OS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Operating System (OS) MCQ: 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? | Extra Education