Computer Science, asked by Anglepriya7956, 1 year ago

3. 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

Answers

Answered by deepakdkt23

0

Answer:

6n+3 is the final answer

Previous Question

Next Question

Similar questions

Math, 6 months ago

Cube<br />Small cubes of dimensions 2cm X 2cm X 2cm joined together to form a larger cube<br />of volume 1000 cm3<br /><br />a) What is the length of each side of larger cube?<br />i) 5cm ii) 10cm iii) 3cm iv) 15cm<br />b) What is the volume of small cube?<br />i) 2cm ii) 4cm<br />iii) 8cm<br />iv) 10cm<br />c) How many small cubes are...

Math, 6 months ago

what is the value of x in this ...

History, 6 months ago

two ways in which a language is influenced by another. NO ERELEVANT ANS!!!! LIKE: IDK, okkk i will ans but never answers.

Physics, 1 year ago

A critical review of the tectonothermal evolution of the bastar craton...

Computer Science, 1 year ago

A computerized data base that permits risk managers to store and analyze risk management data...

Biology, 1 year ago

what are sclerites ?

Biology, 1 year ago

what is macula densa...

Math, 1 year ago

What is the solution of this?