Deadlock - Operating System Questions and Answers

  • 1. What is the 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

Answer: Option 'A'

that can be used by one process at a time and is not depleted by that use

  • 2. Which of the following condition is required for 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

Answer: Option 'D'

all of the mentioned

  • 3. A system is in the safe state if
   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

Answer: Option 'A'

the system can allocate resources to each process in some order and still avoid a deadlock

  • 4. 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

Answer: Option 'A'

defining a linear ordering of resource types

  • 5. 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

Answer: Option 'A'

banker’s algorithm

  • 6. What is the drawback of banker’s algorithm?
   A.) in advance processes rarely know that 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

Answer: Option 'D'

all of the mentioned

  • 7. For 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

Answer: Option 'C'

every time a resource request is made at fixed time intervals

  • 8. A problem encountered in multitasking when a process is perpetually denied necessary resources is called
   A.) deadlock
   B.) starvation
   C.) inversion
   D.) aging

Answer: Option 'B'

starvation

  • 9. 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

Answer: Option 'A'

resource allocation graph

  • 10. 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

Answer: Option 'A'

there must be a fixed number of resources to allocate

Deadlock - Operating System Questions and Answers Download Pdf