Top 550+ Solved Operating System (OS) MCQ Questions Answer
Q. The growing phase is a phase in which?
a. a transaction may obtain locks, but does not release any
b. a transaction may obtain locks, and releases a few or all of them
c. a transaction may release locks, but does not obtain any new locks
d. a transaction may release locks, and does obtain new locks
Q. What is a reusable resource?
a. that can be used by one process at a time and is not depleted by that use
b. that can be used by more than one process at a time
c. that can be shared between various threads
d. none of the mentioned
Q. Which of the following condition is required for a deadlock to be possible?
a. mutual exclusion
b. a process may hold allocated resources while awaiting assignment of other resources
c. no resource can be forcibly removed from a process holding it
d. all of the mentioned
Q. Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
a. the system can allocate resources to each process in some order and still avoid a deadlock
b. there exist a safe sequence
c. all of the mentioned
d. none of the mentioned
Q. The circular wait condition can be prevented by
a. defining a linear ordering of resource types
b. using thread
c. using pipes
d. all of the mentioned
Q. Which one of the following is the deadlock avoidance algorithm?
a. banker’s algorithm
b. round-robin algorithm
c. elevator algorithm
d. karn’s algorithm
Q. What is the drawback of banker’s algorithm?
a. in advance processes rarely know how much resource they will need
b. the number of processes changes as time progresses
c. resource once available can disappear
d. all of the mentioned
Q. For an effective operating system, when to check for deadlock?
a. every time a resource request is made
b. at fixed time intervals
c. every time a resource request is made at fixed time intervals
d. none of the mentioned
Q. A problem encountered in multitasking when a process is perpetually denied necessary resources is called
a. deadlock
b. starvation
c. inversion
d. aging
Q. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
a. resource allocation graph
b. starvation graph
c. inversion graph
d. none of the mentioned
Q. To avoid deadlock
a. there must be a fixed number of resources to allocate
b. resource allocation must be done only once
c. all deadlocked processes must be aborted
d. inversion technique can be used
Q. The number of resources requested by a process
a. must always be less than the total number of resources available in the system
b. must always be equal to the total number of resources available in the system
c. must not exceed the total number of resources available in the system
d. must exceed the total number of resources available in the system
Q. The request and release of resources are
a. command line statements
b. interrupts
c. system calls
d. special programs
Q. For a deadlock to arise, which of the following conditions must hold simultaneously?
a. mutual exclusion
b. no preemption
c. hold and wait
d. all of the mentioned
Q. For non sharable resources like a printer, mutual exclusion
a. must exist
b. must not exist
c. may exist
d. none of the mentioned