Navigate

Question Detail

Which of following is not a condition of Dead Lock ?

  • Mutual Exclusion
  • No Preemption
  • Hold and Wait
  • Data Transfer

Answer: Option D

Similar Questions :

1. Dijkstra's algorithm deals with

  • mutual exclusion
  • deadlock recovery
  • deadlock avoidance
  • cache coherence

Answer: Option C

2. Main function of shared memory is:

  • to use primary memory efficently
  • to do intra process communication
  • to do inter process communication
  • none of above

Answer: Option C

3. To avoid the race condition, the number of processes that may be simultaneously inside the critical section is

  • 12
  • 3
  • 1
  • 0

Answer: Option C

4. Remote computing services involves the use of timesharing and

  • multiprocessing
  • interactive processing
  • batch processing
  • real time processing

Answer: Option C

5. If the property of locality of reference is well pronounced in a program

  • the number of page faults will be more
  • the number of page faults will be less
  • the number of page faults will same
  • none of above

Answer: Option B

Read more from - Operating System Questions Answers - Chapter 1