← Operating System 🟡 Medium 📋 Sanfoundry

A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 …

Question #225 of 1,002+ in Operating System

📝 Question #225

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?

⌨️ Press A B C D to select

All Options & Correct Answer

A 2 Correct
B 3
C 4
D 1

📋 Question Details

📚
Subject
Operating System
🎯
Difficulty
Medium
📅
Year
📋
Source
Sanfoundry

📤 Share This MCQ

📚 Want More?

Practice Operating System MCQs

1,002+ questions with detailed answers