Explore topic-wise MCQs in Operating System.

This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.

1.

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________

A. can never occur
B. may occur
C. has to occur
D. none of the mentioned
Answer» B. may occur
Discussion
2.

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
Answer» B. 3
Discussion
3.

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________

A. the set of processes that have been deadlocked
B. the set of processes in the deadlock queue
C. the specific process that caused the deadlock
D. all of the mentioned
Answer» B. the set of processes in the deadlock queue
Discussion
4.

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
Answer» C. then the system is in a safe state
Discussion
5.

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
Answer» B. Pj is waiting for Pi to release a resource that Pj needs
Discussion
6.

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
Answer» B. all resources have multiple instances
Discussion