Question Detail

Dijkstra's algorithm deals with

  • mutual exclusion
  • deadlock recovery
  • deadlock avoidance
  • cache coherence
Similar Questions :

1. The LRU algorithm

  • pages out pages that have been used recently
  • pages out pages that have not been used recently
  • pages out pages that have been least used recently
  • pages out the first page in a given area

2. Multiprogramming systems

  • Are easier to develop than single programming systems
  • Execute each job faster
  • Execute more jobs in the same time
  • Are used only on large main frame computers

3. Main function of shared memory is:

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

4. Creating a job queue is a function of

  • Spooler
  • Interperator
  • Complier
  • Drive

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

  • FCFS
  • round robin
  • Shortest job first
  • Pre-empitive
Read more from - Operating System Questions Answers - Chapter 1