download Mastguru Android App

Question Detail

Four necessary conditions for deadlock are non pre-emption, circular wait, hold and wait and

  • mutual exclusion
  • race condition
  • buffer overflow
  • None of above

Answer: Option A

Similar Questions :

1. Reference bit is used for

  • Implementing LRU page replacement algorithm
  • Implementing NRU algorithm
  • To check the page table entry in the cache memory
  • none of above

Answer: Option B

2. A hardware device which is capable of executing a sequence of instructions, is known as

  • CPU
  • ALU
  • CU
  • Processor

Answer: Option D

3. In which scheduling policies, context switching never takes place

  • FCFS
  • round robin
  • Shortest job first
  • Pre-empitive

Answer: Option A

4. Which among following scheduling algorithms give minimum average waiting time

  • FCFS
  • SJF
  • Round robin
  • On priority

Answer: Option B

5. Four necessary conditions for deadlock are non pre-emption, circular wait, hold and wait and

  • mutual exclusion
  • race condition
  • buffer overflow
  • None of above

Answer: Option A

Read more from - Operating System Questions Answers - Chapter 1
Post a comment

    Mastguru Youtube Channel

    Videos @mastguru

    Free useful videos - Subscribe Mastguru
     

    Get Free Current Affairs and Govt Jobs Alerts in your mailbox

    To Appreciate Our Effort, Please Like Us

    Quantitative Aptitude
    English Aptitude
    Reasoning Aptitude
    Computer Awareness
    General Knowledge
    Current Affairs
    IT Officer Aptitude
    Programming Aptitude
    Latest Govt Jobs