M
Operating System (OS) MCQs | Page - 39
Dear candidates you will find MCQ questions of Operating System (OS) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
M
Q. All unsafe states are
M
Q. If no cycle exists in the resource allocation graph
M
Q. The resource allocation graph is not applicable to a resource allocation system
M
Q. The data structures available in the Banker’s algorithm are
M
Q. The content of the matrix Need is
M
Q. The wait-for graph is a deadlock detection algorithm that is applicable when
M
Q. An edge from process Pi to Pj in a wait for graph indicates that
M
Q. If the wait for graph contains a cycle
M
Q. If deadlocks occur frequently, the detection algorithm must be invoked
Jump to