M

Mr. Dubey • 100.69K Points
Coach

Q. If the wait for graph contains a cycle

  • (A) then a deadlock does not exist
  • (B) then a deadlock exists
  • (C) then the system is in a safe state
  • (D) either deadlock exists or system is in a safe state
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.

Related MCQs

Q. Two main measures for the efficiency of an algorithm are____________.

Q. Which of the following is not a diagram studied in Requirement Analysis?

Q. In computer network nodes are

Q. What is the corresponding text for the <#1/1/ 95# validation rule setting?

Q. which of the following is not Guided transmission media

Q. Which one of the following routing algorithm can be used for network layer design?

Q. Organisational success in providing a service or a product depends on

Q. In a circular queue, how do you increment the rear end of the queue?

Q. The is essentially used to search for patterns in target string.

Q. Which of the following is not a core step of Six Sigma?

Question analytics