Operating Systems MCQs Set-4

1. Process synchronization can be done on
  • hardware level
  • software level
  • both (a) and (b)
  • none of the mentioned
2. A monitor is a module that encapsulates
  • shared data structures
  • procedures that operate on shared data structure
  • synchronization between concurrent procedure invocation
  • all of the mentioned
3. What is the reusable resource?
  • that can be used by one process at a time and is not depleted by that use
  • that can be used by more than one process at a time
  • that can be shared between various threads
  • none of the mentioned
4. Which of the following condition is required for deadlock to be possible?
  • mutual exclusion
  • a process may hold allocated resources while awaiting assignment of other resources
  • no resource can be forcibly removed from a process holding it
  • all of the mentioned
5. Which one of the following is the deadlock avoidance algorithm?
  • banker’s algorithm
  • round-robin algorithm
  • elevator algorithm
  • karn’s algorithm
6. For effective operating system, when to check for deadlock?
  • every time a resource request is made
  • at fixed time intervals
  • both (a) and (b)
  • none of the mentioned
7. To avoid deadlock
  • there must be a fixed number of resources to allocate
  • resource allocation must be done only once
  • all deadlocked processes must be aborted
  • inversion technique can be used
8. An un-interruptible unit is known as :
  • single
  • atomic
  • static
  • None of these
9. Semaphore is a/an _______ to solve the critical section problem.
  • hardware for a system
  • special program for a system
  • integer variable
  • None of these
10. CPU fetches the instruction from memory according to the value of
  • program counter
  • status register
  • instruction register
  • program status word