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

Mr. Dubey • 97.30K Points
Coach

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

  • (A) wait & signal
  • (B) hold & wait
  • (C) signal & hold
  • (D) continue & signal
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. If no cycle exists in the resource allocation graph

  • (A) then the system will not be in a safe state
  • (B) then the system will be in a safe state
  • (C) all of the mentioned
  • (D) none of the mentioned
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) with multiple instances of each resource type
  • (B) with a single instance of each resource type
  • (C) single & multiple instances of each resource type
  • (D) none of the mentioned
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) available
  • (B) need
  • (C) allocation
  • (D) all of the mentioned
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. The content of the matrix Need is

  • (A) allocation – available
  • (B) max – available
  • (C) max – allocation
  • (D) allocation – max
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) all resources have a single instance
  • (B) all resources have multiple instances
  • (C) all resources have a single 7 multiple instances
  • (D) all of the mentioned
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) pi is waiting for pj to release a resource that pi needs
  • (B) pj is waiting for pi to release a resource that pj needs
  • (C) pi is waiting for pj to leave the system
  • (D) pj is waiting for pi to leave the system
Show Answer Discuss Share

M

Mr. Dubey • 97.30K 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
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) rarely
  • (B) frequently
  • (C) rarely & frequently
  • (D) none of the mentioned
Show Answer Discuss Share

Jump to

Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.

Image