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. Shortest Job First executes first the job

  • with the least processor needs
  • that first entered the queue
  • that has been in the queue for the longest
  • that last entered the queue

2. Problem of thrashing is affected significantly by

  • program structure
  • program size
  • primary storage size
  • all of above

3. Operating system is

  • A collection of hardware components
  • A collection of input output devices
  • A collection of software routines
  • All of above

4. Macintosh computer uses

  • System 7.0
  • AU/X
  • Xenix
  • none of above

5. Dijkstra's algorithm deals with

  • mutual exclusion
  • deadlock recovery
  • deadlock avoidance
  • cache coherence
Read more from - Operating System Questions Answers - Chapter 1