A computer system has 6 tape drives, with n process competing for them. Each…

PYQ GATE 1992

A computer system has 6 tape drives, with n process 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

  1. A.

    2

  2. B.

    3

  3. C.

    4

  4. D.

    1

Attempted by 548 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…