Operating System (OS) MCQs | Page - 39

Q. 381) What are the operations that can be invoked on a condition variable?

Q. 382) All unsafe states are                          

Q. 383) If no cycle exists in the resource allocation graph                          

Q. 384) The resource allocation graph is not applicable to a resource allocation system

Q. 385) The data structures available in the Banker’s algorithm are                          

Q. 386) The content of the matrix Need is

Q. 387) The wait-for graph is a deadlock detection algorithm that is applicable when

Q. 388) An edge from process Pi to Pj in a wait for graph indicates that                          

Q. 389) If the wait for graph contains a cycle

Q. 390) If deadlocks occur frequently, the detection algorithm must be invoked