download Mastguru Android App

Question Detail

Dijkstra's algorithm deals with

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

Answer: Option C

Similar Questions :

1. Which is non pre-emptive

  • Round robin
  • FIFO
  • MQS
  • MQSF

Answer: Option B

2. Daisy chain is a device for

  • connecting a number of controllers to a device
  • connecting a number of device to a controller
  • all of above
  • none of above

Answer: Option B

3. 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

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

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

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

Answer: Option A

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

  • abhijit 12 years ago

    ans c is correct ans.......

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