Reply To: Computer Science and Information Technology (CS)- Jobs [GATE 2012]

  1. Anusha Kurra

    heyy for the problem u solved on the other day
    A computer has 6 tape drives with N process competing for them.. each process need 3 drives… then the max value for N to b deadlock free is??????
    u solved using that formulae…which was 2
    but correct answer is 3.

    if any 1 knw the solution fot this plzz tell the solution