download Mastguru Android App

Question Detail

Which scheduling policy is best suited for time-sharing operating systems

  • Shortest job first
  • Round robin
  • First come first serve
  • Elevator
Similar Questions :

1. Memory protection is normally done by

  • the processor and the associated hardware
  • the operating system
  • the compiler
  • the user program

2. Dijkstra's algorithm deals with

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

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

  • CPU
  • ALU
  • CU
  • Processor

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

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
Read more from - Operating System Questions Answers - Chapter 1
Post a comment

  • Latrice 11 years ago

    I guess finding useful, reliable information on the itenrnet isn't hopeless after all.