Sail E0 Webinar

MCQs

Total Questions : 21 | Page 2 of 3 pages
Question 11. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
  1.    resource allocation graph
  2.    starvation graph
  3.    inversion graph
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> resource allocation graph


None.


Question 12. The number of resources requested by a process :
  1.    must always be less than the total number of resources available in the system
  2.    must always be equal to the total number of resources available in the system
  3.    must not exceed the total number of resources available in the system
  4.    must exceed the total number of resources available in the system
 Discuss Question
Answer: Option C. -> must not exceed the total number of resources available in the system


None.


Question 13. To avoid deadlock:
  1.    there must be a fixed number of resources to allocate
  2.    resource allocation must be done only once
  3.    all deadlocked processes must be aborted
  4.    inversion technique can be used
 Discuss Question
Answer: Option A. -> there must be a fixed number of resources to allocate


None.


Question 14. For effective operating system, when to check for deadlock?
  1.    every time a resource request is made
  2.    at fixed time intervals
  3.    both (a) and (b)
  4.    none of the mentioned
 Discuss Question
Answer: Option C. -> both (a) and (b)


None.


Question 15. A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
  1.    deadlock
  2.    starvation
  3.    inversion
  4.    aging
 Discuss Question
Answer: Option B. -> starvation


None.


Question 16. The request and release of resources are ___________.
  1.    command line statements
  2.    interrupts
  3.    system calls
  4.    special programs
 Discuss Question
Answer: Option C. -> system calls


None.


Question 17. Multithreaded programs are :
  1.    lesser prone to deadlocks
  2.    more prone to deadlocks
  3.    not at all prone to deadlocks
  4.    None of these
 Discuss Question
Answer: Option B. -> more prone to deadlocks


Multiple threads can compete for shared resources.


Question 18. For a Hold and wait condition to prevail :
  1.    A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it
  2.    A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
  3.    A process must hold at least one resource and not be waiting to acquire additional resources
  4.    None of these
 Discuss Question
Answer: Option B. -> A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes


None.


Question 19. For Mutual exclusion to prevail in the system :
  1.    at least one resource must be held in a non sharable mode
  2.    the processor must be a uniprocessor rather than a multiprocessor
  3.    there must be at least one resource in a sharable mode
  4.    All of these
 Discuss Question
Answer: Option A. -> at least one resource must be held in a non sharable mode


If another process requests that resource (non “ shareable resource), the requesting process must be delayed until the resource has been released.


Question 20. Deadlock prevention is a set of methods :
  1.    to ensure that at least one of the necessary conditions cannot hold
  2.    to ensure that all of the necessary conditions do not hold
  3.    to decide if the requested resources for a process have to be given or not
  4.    to recover from a deadlock
 Discuss Question
Answer: Option A. -> to ensure that at least one of the necessary conditions cannot hold


None.


Latest Videos

Latest Test Papers