Top 550+ Solved Operating System (OS) MCQ Questions Answer
Q. The disadvantage of a process being allocated all its resources before beginning its execution is
a. low cpu utilization
b. low resource utilization
c. very high resource utilization
d. none of the mentioned
Q. Each request requires that the system consider the to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
a. resources currently available
b. processes that have previously been in the system
c. resources currently allocated to each process
d. future requests and releases of each process
Q. A deadlock avoidance algorithm dynamically examines the to ensure that a circular wait condition can never exist.
a. resource allocation state
b. system storage state
c. operating system
d. resources
Q. A state is safe, if
a. the system does not crash due to deadlock occurrence
b. the system can allocate resources to each process in some order and still avoid a deadlock
c. the state keeps the system protected and safe
d. all of the mentioned
Q. A system is in a safe state only if there exists a
a. safe allocation
b. safe resource
c. safe sequence
d. all of the mentioned
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
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
Q. The data structures available in the Banker’s algorithm are
a. available
b. need
c. allocation
d. all of the mentioned
Q. The content of the matrix Need is
a. allocation – available
b. max – available
c. max – allocation
d. allocation – max
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
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
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
Q. If deadlocks occur frequently, the detection algorithm must be invoked
a. rarely
b. frequently
c. rarely & frequently
d. none of the mentioned
Q. What is the disadvantage of invoking the detection algorithm for every request?
a. overhead of the detection algorithm due to consumption of memory
b. excessive time consumed in the request to be allocated memory
c. considerable overhead in computation time
d. all of the mentioned