CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Quantitative Aptitude

Permutation

A computer sy...

Question

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

Open in App

Solution

If there are 2 processes then each process will hold 3 tape drives as there are 6 tape drives for which the system is guaranteed to be deadlck free.

Suggest Corrections

thumbs-up

0

Similar questions

Q. A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?

Q. A system share 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below:

Process	Current Allocation	Maximum Requirement
P1 P2 P3	3 1 3	7 6 5

Which of the following best describes current state of the system?

Q. System has 5 processes with a single resource R having 'K' copies. Each process needs exactly 3 copies to complete their execution. What is the max value of 'K' for which deadlock occurs?

Q. There are resources in system, n processes & k is the requirement of each process. Which of the following condition must be satisfied so that deadlock free operation is guaranteed with minimum number of resources?

Q. The maximum number of processes that can be in Ready state for a computer system with n CPUs is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Permutation

QUANTITATIVE APTITUDE

Watch in App

explore_more_icon

Explore more

Other Quantitative Aptitude

Join BYJU'S Learning Program

CrossIcon