M

Mr. Dubey • 87.94K Points
Coach 

Q. 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?

(A) 2
(B) 3
(C) 4
(D) 1
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. MPI specifies the functionality of _________________ communication routines.

Q. Binary circuit elements have

Q. Consider the following grammars (S1) : A --> aBCD B --> bc|c C --> d|∈ D -> b (S2) : A --> aBCD B --> bc|∈ C --> d|c D

Q. _______________ is the goal of data mining.

Q. If we multiply ' 723 ' and ' 34 ' by representing them in floating point notation i.e. By first, converting them in floating point

Q. ‘AS’ clause is used in SQL for

Q. An array, in perl, is an

Q. dump, writes out SQL DDL statements and SQL insert statements to a file, which can then be reexecuted to re- create the database.

Q. Which of the following is NOT a standard related to testing?

Q. What is a high performance multi-core processor that can be used to accelerate a wide variety of applications using parallel computing.

Question analytics